On (s,t)-supereulerian graphs in locally highly connected graphs

DOI10.1016/J.DISC.2009.08.012zbMath1216.05070OpenAlexW1982899636MaRDI QIDQ965976

Lan Lei, Xiao-Min Li, Hong-Jian Lai, Bin Wang

Publication date: 27 April 2010

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

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

zbMATH Keywords

collapsible graph(\(s,t\))-supereulerianlocally \(k\)-edge-connectedlocally connected graphs

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Strengthened Ore conditions for \((s, t)\)-supereulerian graphs ⋮ Asymptotically sharpening the $s$-Hamiltonian index bound ⋮ On \(( s , t )\)-supereulerian graphs with linear degree bounds ⋮ Polynomially determine if a graph is \((s,3)\)-supereulerian ⋮ Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractions and hamiltonian line graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs

This page was built for publication: On (s,t)-supereulerian graphs in locally highly connected graphs