Spanning trails containing given edges

DOI10.1016/j.disc.2005.10.022zbMath1086.05045OpenAlexW2051936684MaRDI QIDQ817757

Zhi-Hong Chen, Weiqi Luo, Wei-Guo Chen

Publication date: 20 March 2006

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

Full work available at URL: https://digitalcommons.butler.edu/cgi/viewcontent.cgi?article=1144&context=facsch_papers

zbMATH Keywords

Eulerian connectivity

Mathematics Subject Classification ID

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

Related Items

Strengthened Ore conditions for \((s, t)\)-supereulerian graphs ⋮ Supereulerian width of dense graphs ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Degree sum and Hamiltonian-connected line graphs ⋮ 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 ⋮ Spanning trails in essentially 4-edge-connected graphs ⋮ Spanning trails in a 2-connected graph ⋮ Catlin’s reduced graphs with small orders ⋮ A condition on Hamilton-connected line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs without spanning closed trails
• Eulerian graphs and related topics. Part 1, Volume 1
• Connectivity and edge-disjoint spanning trees
• Bounds of the number of disjoint spanning trees
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• A Note on Sub-Eulerian Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Eulerian subgraphs containing given edges