Supereulerian graphs and the Petersen graph

DOI10.1007/s10114-014-2272-yzbMath1283.05156OpenAlexW1969402681MaRDI QIDQ5920288

No author found.

Publication date: 18 March 2014

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-014-2272-y

zbMATH Keywords

contractionreductionPetersen graphsupereulerian graphsedge-cut

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Fan-type conditions for spanning Eulerian subgraphs ⋮ Snarks, hypohamiltonian graphs and non-supereulerian graphs ⋮ Lai's conditions for spanning and dominating closed trails ⋮ On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs without spanning closed trails
• A note on graphs spanned by Eulerian graphs
• On circuits and pancyclic line graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• A Note on Sub-Eulerian Graphs
• Collapsible graphs and matchings
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• Supereulerian graphs and the Petersen graph