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

DOI10.1016/j.dam.2022.05.003zbMath1496.05092OpenAlexW4282567827WikidataQ113877205 ScholiaQ113877205MaRDI QIDQ2166214

Taoye Zhang, Yang Wu, Xiaoming Li, Hong-Jian Lai, Lan Lei

Publication date: 24 August 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.05.003

zbMATH Keywords

reductionedge-connectivitysupereulerian graphscollapsible graphsclosed trailsneighborhood conditions\((s, t)\)-supereulerian

Mathematics Subject Classification ID

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

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
• On \(( s , t )\)-supereulerian graphs with linear degree bounds
• Polynomially determine if a graph is \((s,3)\)-supereulerian
• Note on edge-disjoint spanning trees and eigenvalues
• A note on graphs spanned by Eulerian graphs
• Note on Hamilton Circuits
• 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: Strengthened Ore conditions for \((s, t)\)-supereulerian graphs