270 search results - page 1 / 54 » Diameter bounds for planar graphs |
ALGORITHMICA
2004
13 years 4 months ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
DM
2011
12 years 11 months ago
2011
CORR
1999
Springer
13 years 4 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
ARSCOM
2006
13 years 4 months ago
2006
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
CCCG
2009
13 years 6 months ago
2009
We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.