Name
Abstract | ||
|---|---|---|
This article uses the discharging method to obtain the best possible results that a 3-connected graph embeddable on a surface of Euler characteristic χ ≤ -46 has a spanning tree of maximum degree at most $\lceil {{8-2\chi}\over{3}}\rceil$ and a closed, spanning walk meetting each vertex at most $\lceil {{6-2\chi}\over{3}}\rceil$ times. Each of these results is shown to be best possible. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 67–74, 2001 |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1002/1097-0118(200102)36:2<>1.0.CO;2-W | Journal of Graph Theory |
Keywords | Field | DocType |
spanning trees,maximum degree,spanning tree | Graph theory,Discharging method,Topology,Discrete mathematics,Combinatorics,Minimum degree spanning tree,Euler characteristic,Degree (graph theory),Spanning tree,Shortest-path tree,Mathematics,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
36 | 2 | 0364-9024 |
Citations | PageRank | References |
5 | 0.46 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel P. Sanders | 1 | 471 | 45.56 |
| Yue Zhao | 2 | 125 | 11.88 |