Name
Abstract | ||
|---|---|---|
This paper generalizes a theorem of Thomassen on paths in planar graphs. As a corollary, it is shown that every 4-connected planar graph has a Hamilton path between any two specified vertices x,y and containing any specified edge other than xy. (C) 1997 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
1997 | 3.3.CO;2-4" target="_self" class="small-link-text"10.1002/(SICI)1097-0118(199704)24:43.3.CO;2-4 | Journal of Graph Theory |
Keywords | Field | DocType |
planar graph | Outerplanar graph,Combinatorics,Forbidden graph characterization,Planar straight-line graph,Chordal graph,Steinitz's theorem,Book embedding,1-planar graph,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
24 | 4 | 0364-9024 |
Citations | PageRank | References |
30 | 2.52 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel P. Sanders | 1 | 471 | 45.56 |