Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Supereulerian Graphs and the Petersen Graph

Zhi-Hong Chen1
1 Department of Mathematics Wayne State University Detroit, MI U.S.A. 48202
  • Published: 30/04/1991

Abstract

Using a contraction method, we find some best-possible sufficient conditions for \(3\)-edge-comected simple graphs such that either the graphs have spanning eulerian subgraphs or the graphs are contractible to the Petersen graph.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Zhi-Hong Chen. Supereulerian Graphs and the Petersen Graph[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 009. 79-89. DOI: .