Supereuleriaun graphs and the Petersen graph

Authors

Zhi-Hong Chen, Butler UniversityFollow

Document Type

Article

Publication Date

1991

Publication Title

Journal of Combinatorial Mathematics and Combinatorial Computing

First Page

79

Last Page

89

Abstract

Using a contraction method, we find some best-possible sufficient condi­tions for 3-edge-connected simple graphs such that either the graphs have spanning eulerian subgraphs or the graphs are contractible to the Petersen graph.

Rights

This article was originally published in Journal of Combinatorial Mathematics and Combinatorial Computing, 1991, Volume 9.

Recommended Citation

Chen, Zhi-Hong, "Supereuleriaun graphs and the Petersen graph" Journal of Combinatorial Mathematics and Combinatorial Computing / (1991): 79-89.
Available at https://digitalcommons.butler.edu/facsch_papers/1055