Spanning closed trails in graphs

Document Type

Article

Publication Date

July 1993

Publication Title

Discrete Mathematics

First Page

57

Last Page

71

DOI

https://doi.org/10.1016/0012-365X(93)90324-M

Abstract

Let G be a 2-edge-connected simple graph on n>;95 vertices. Let l be the number of vertices of degree 2 in G. We prove that if l

Notes

Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the article or borrow it from a local library.

Share

COinS