388 search results - page 9 / 78 » On the Number of Cycles in Planar Graphs |
AAIM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...
SIAMDM
2008
14 years 11 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
DM
2010
14 years 11 months ago
2010
For a graph G let
76
Voted
GD
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
115
click to vote
JGT
2010
14 years 10 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose