Article
Supereuleriaun graphs and the Petersen graph
Journal of Combinatorial Mathematics and Combinatorial Computing
Document Type
Article
Publication Date
1-1-1991
Disciplines
Abstract
Using a contraction method, we find some best-possible sufficient conditions 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.
Citation Information
Zhi-Hong Chen. "Supereuleriaun graphs and the Petersen graph" Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 9 (1991) p. 79 - 89 Available at: http://works.bepress.com/zhi_hong_chen/42/