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

DOI10.1016/J.DISC.2020.112239MaRDI QIDQ2222943zbMATH OpenOpenAlexFDO

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

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

\( ( sclosed trailscollapsible graphsedge-connectivityreductionsupereulerian graphst )\)-supereulerian

Mathematics Subject Classification ID

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

Recommendations

• Strengthened Ore conditions for (s, t)-supereulerian graphs
• Polynomially determine if a graph is \((s,3)\)-supereulerian
• On (s,t)-supereulerian graphs in locally highly connected graphs
• A note on minimum degree conditions for supereulerian graphs
• On extremal k-supereulerian graphs

Cites work

• A note on graphs spanned by Eulerian graphs
• A reduction method to find spanning Eulerian subgraphs
• Collapsible subgraphs of a 4-edge-connected graph
• Edge-connectivity and edge-disjoint spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Eulerian subgraphs containing given edges
• Graph theory
• Graphs without spanning closed trails
• scientific article; zbMATH DE number 4006296 (Why is no real title available?)
• scientific article; zbMATH DE number 6475963 (Why is no real title available?)
• Note on edge-disjoint spanning trees and eigenvalues
• On (s,t)-supereulerian graphs in locally highly connected graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Spanning trails containing given edges
• Spanning trails in essentially 4-edge-connected graphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs

Cited in

(8)

• A note on minimum degree conditions for supereulerian graphs
• Strengthened Ore conditions for (s, t)-supereulerian graphs
• Polynomially determine if a graph is \((s,3)\)-supereulerian
• Supereulerian width of dense graphs
• Super-Eulerian graphs of minimum degree at least 4.
• Squares of graphs are optimally (s, t)-supereulerian
• Collapsibility of k-edge connected graphs and (s, t)-supereulerian problem
• On (s,t)-supereulerian graphs in locally highly connected graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222943)