Title

On Spanning Trees And Walks Of Low Maximum Degree

Keywords

Spanning trees; Spanning walks

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 [8-2χ/3] and a closed, spanning walk meetting each vertex at most [6-2χ/3] times. Each of these results is shown to be best possible. © 2001 John Wiley & Sons, Inc.

Publication Date

1-1-2001

Publication Title

Journal of Graph Theory

Volume

36

Issue

2

Number of Pages

67-74

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1002/1097-0118(200102)36:2<67::AID-JGT2>3.0.CO;2-C

Socpus ID

23044521934 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/23044521934

This document is currently not available here.

Share

COinS