270 search results - page 14 / 54 » Diameter bounds for planar graphs |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
WINE
2009
Springer
15 years 6 months ago
2009
Springer
ENDM
2008
14 years 12 months ago
2008
JGT
2006
14 years 11 months ago
2006
DM
2010
14 years 12 months ago
2010
In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimensio...