Supereulerian Digraphs with Large Arc-Strong Connectivity

DOI10.1002/JGT.21885zbMath1333.05132OpenAlexW1930841953MaRDI QIDQ2800596

Mansour J. Algefari, Hong-Jian Lai

Publication date: 15 April 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21885

zbMATH Keywords

maximum matchingEulerian digraphssuper-Eulerian digraphsstrong arc connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (9)

Unnamed Item ⋮ Subeulerian oriented graphs ⋮ Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs ⋮ Locally dense supereulerian digraphs ⋮ Matching and spanning trails in digraphs ⋮ Symmetric core and spanning trails in directed networks ⋮ Supereulerian 3-path-quasi-transitive digraphs ⋮ Degree condition for a digraph to be supereulerian ⋮ Supereulerian digraphs with given diameter

Cites Work

• Unnamed Item
• Supereulerian graphs and matchings
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• Supereulerian digraphs
• A note on Hamiltonian circuits
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
• A note on graphs spanned by Eulerian graphs
• TWO THEOREMS IN GRAPH THEORY
• Long Cycles in Digraphs
• 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: Supereulerian Digraphs with Large Arc-Strong Connectivity