Locally dense supereulerian digraphs

DOI10.1016/J.DAM.2017.11.030zbMath1380.05083OpenAlexW2782194400MaRDI QIDQ1701108

Hong-Jian Lai, Mansour J. Algefari, Jin-Quan Xu

Publication date: 22 February 2018

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

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

zbMATH Keywords

maximum matchingEulerian digraphssuper-Eulerian digraphsstrong arc connectivitylocally dense

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

Unnamed Item ⋮ Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs ⋮ Symmetric core and spanning trails in directed networks ⋮ Degree condition for a digraph to be supereulerian

Cites Work

• Unnamed Item
• Unnamed Item
• Ore-type degree condition of supereulerian digraphs
• Supereulerian graphs and matchings
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• Supereulerian digraphs
• A note on Hamiltonian circuits
• Supereulerian Digraphs with Large Arc-Strong Connectivity
• Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
• A note on graphs spanned by Eulerian graphs
• A reduction method to find spanning Eulerian subgraphs
• Long Cycles in Digraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Sufficient Conditions for a Digraph to be Supereulerian
• Digraphs
• Supereulerian digraphs with given local structures

This page was built for publication: Locally dense supereulerian digraphs