388 search results - page 4 / 78 » On the Number of Cycles in Planar Graphs |
GD
2006
Springer
13 years 10 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
JDA
2010
13 years 4 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
COCO
2010
Springer
13 years 3 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
STOC
2010
ACM
14 years 3 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
ESA
1999
Springer
13 years 10 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...