On spanning trees and walks of low maximum degree

    Authors

    D. P. Sanders;Y. Zhao

    Abbreviated Journal Title

    J. Graph Theory

    Keywords

    spanning trees; spanning walks; GRAPHS; SUBGRAPHS; Mathematics

    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 chi less than or equal to -46 has a spanning tree of maximum degree at most [8-2 chi / 3] and a closed, spanning walk meetting each vertex at most [6-2 chi / 3] times. Each of these results is shown to be best possible. (C) 2001 John Wiley & Sons, Inc.

    Journal Title

    Journal of Graph Theory

    Volume

    36

    Issue/Number

    2

    Publication Date

    1-1-2001

    Document Type

    Article

    Language

    English

    First Page

    67

    Last Page

    74

    WOS Identifier

    WOS:000166534900002

    ISSN

    0364-9024

    Share

    COinS