A new condition on dominated pair degree sum for a digraph to be supereulerian
From MaRDI portal
Publication:6657269
DOI10.1016/J.DAM.2024.11.006MaRDI QIDQ6657269
Jixiang Meng, Changchang Dong, Juan Liu
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Cites Work
- Ore-type degree condition of supereulerian digraphs
- Supereulerian digraphs
- Degree condition for a digraph to be supereulerian
- Sufficient Ore type condition for a digraph to be supereulerian
- Supereulerian digraphs with large arc-strong connectivity
- A note on graphs spanned by Eulerian graphs
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
- Sufficient Conditions for a Digraph to be Supereulerian
- Digraphs
This page was built for publication: A new condition on dominated pair degree sum for a digraph to be supereulerian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657269)