On \(( s , t )\)-supereulerian graphs with linear degree bounds

DOI10.1016/j.disc.2020.112239zbMath1456.05096OpenAlexW3109059064MaRDI QIDQ2222943

Yikang Xie, Hong-Jian Lai, Wei Xiong, Lan Lei, Mingquan Zhan

Publication date: 27 January 2021

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

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

zbMATH Keywords

reductionedge-connectivitysupereulerian graphscollapsible graphsclosed trails\( ( st )\)-supereulerian

Mathematics Subject Classification ID

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

Related Items (1)

Strengthened Ore conditions for \((s, t)\)-supereulerian graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trails in essentially 4-edge-connected graphs
• Spanning trails containing given edges
• On (s,t)-supereulerian graphs in locally highly connected graphs
• Edge-connectivity and edge-disjoint spanning trees
• Graphs without spanning closed trails
• Collapsible subgraphs of a 4-edge-connected graph
• Note on edge-disjoint spanning trees and eigenvalues
• A note on graphs spanned by Eulerian graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Eulerian subgraphs containing given edges

This page was built for publication: On \(( s , t )\)-supereulerian graphs with linear degree bounds