Join Our Newsletter

WG

2007

Springer

13 years 3 months ago
2007

Springer

Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...

WG

2007

Springer

13 years 3 months ago
2007

Springer

WG

2007

Springer

13 years 3 months ago
2007

Springer

In the Planar +k vertex problem the task is to ﬁnd at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...

WG

2007

Springer

13 years 3 months ago
2007

Springer

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...

WG

2007

Springer

13 years 3 months ago
2007

Springer

A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...

WG

2007

Springer

13 years 3 months ago
2007

Springer

NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...

WG

2007

Springer

13 years 3 months ago
2007

Springer

WG

2007

Springer

13 years 3 months ago
2007

Springer

Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...

WG

2007

Springer

13 years 3 months ago
2007

Springer

WG

2007

Springer

13 years 3 months ago
2007

Springer

We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...