Sufficient Conditions for a Digraph to be Supereulerian

DOI10.1002/JGT.21810zbMath1312.05060OpenAlexW1540986033MaRDI QIDQ5251197

Alessandro Maddaloni, Jörgen Bang-Jensen

Publication date: 22 May 2015

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

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

zbMATH Keywords

independence numberarc-connectivitysemicomplete multipartite digraphdegree conditionsspanning closed trailsupereulerian digraphquasitransitive digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (22)

Ore-type degree condition of supereulerian digraphs ⋮ Constructing featured supereulerian graph ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ Spanning eulerian subdigraphs in semicomplete digraphs ⋮ Unnamed Item ⋮ Subeulerian oriented graphs ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ 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 ⋮ Sufficient Ore type condition for a digraph to be supereulerian ⋮ Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ Supereulerian 3-path-quasi-transitive digraphs ⋮ Supereulerian digraphs with given local structures ⋮ Vertex degree sums for supereulerian bipartite digraphs ⋮ Trails, paths and cycles of digraphs with \(\alpha_2\)-stable number 2 ⋮ A new condition on dominated pair degree sum for a digraph to be supereulerian ⋮ On supereulerian 2-edge-coloured graphs ⋮ Degree condition for a digraph to be supereulerian ⋮ Supereulerian digraphs with given diameter

Cites Work

• Unnamed Item
• Unnamed Item
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• Contractions of graphs with no spanning Eulerian subgraphs
• A short proof of Meyniel's theorem
• (Arc-)disjoint flows in networks
• A note on Hamiltonian circuits
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Note on Hamilton Circuits
• On circuits and pancyclic line graphs
• Long Cycles in Digraphs
• Supereulerian graphs: A survey
• On Spanning and Dominating Circuits in Graphs
• A Note on Sub-Eulerian Graphs
• Quasi‐transitive digraphs
• Digraphs
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: Sufficient Conditions for a Digraph to be Supereulerian