On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)

DOI10.1016/j.disc.2010.05.021zbMath1230.05189OpenAlexW2130910508MaRDI QIDQ708409

Dengxin Li, Hong-Jian Lai, Xiao-Min Li

Publication date: 11 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.05.021

zbMATH Keywords

reductionPetersen graphsupereulerian graphscollapsible graphsedge-cut

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

Lai's conditions for spanning and dominating closed trails, Catlin’s reduced graphs with small orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
• The supereulerian graphs in the graph family \(C(l,k)\)
• Graphs without spanning closed trails
• A note on minimum degree conditions for supereulerian graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• A note on graphs spanned by Eulerian graphs
• On circuits and pancyclic line graphs
• Contractions and hamiltonian line graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Supereulerian graphs and the Petersen graph
• Supereulerian graphs and the Petersen graph