3008 search results - page 194 / 602 » Independence in connected graphs |
215
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
156
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
169
click to vote
JGT
2006
15 years 6 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
157
click to vote
GC
2010
Springer
15 years 5 months ago
2010
Springer
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...