Supereulerian digraphs with large arc-strong connectivity

DOI10.1002/JGT.21885zbMATH Open1333.05132OpenAlexW1930841953MaRDI QIDQ2800596FDOQ2800596

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

super-Eulerian digraphsmaximum matchingstrong arc connectivityEulerian digraphs

Mathematics Subject Classification ID

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

Cites Work

• Digraphs
• A note on Hamiltonian circuits
• A note on graphs spanned by Eulerian graphs
• Supereulerian digraphs
• TWO THEOREMS IN GRAPH THEORY
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• Sufficient Conditions for a Digraph to be Supereulerian
• Supereulerian graphs and matchings
• 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
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• Long Cycles in Digraphs
• Title not available (Why is that?)

Cited In (15)

• Subeulerian oriented graphs
• Symmetric core and spanning trails in directed networks
• Title not available (Why is that?)
• Vertex degree sums for supereulerian bipartite digraphs
• Matching and spanning trails in digraphs
• Super-connected arc-transitive digraphs
• Supereulerian digraphs with given diameter
• Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs
• Trails, paths and cycles of digraphs with \(\alpha_2\)-stable number 2
• Super-arc-connectivity properties of strongly connected digraphs
• Supereulerian 3-path-quasi-transitive digraphs
• Degree condition for a digraph to be supereulerian
• Spanning eulerian subdigraphs in semicomplete digraphs
• A new condition on dominated pair degree sum for a digraph to be supereulerian
• Locally dense supereulerian digraphs

   Recommendations

• Super-arc-connectivity properties of strongly connected digraphs 👍 👎
• Super-arc-connected and super-connected total digraphs 👍 👎
• Super-connected arc-transitive digraphs 👍 👎
• Title not available (Why is that?) 👍 👎
• The superconnectivity of large digraphs and graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Superconnected digraphs and graphs with small conditional diameters 👍 👎
• Super connectivity of line graphs and digraphs 👍 👎
• Super-connected and super-arc-connected Cartesian product of digraphs 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Supereulerian digraphs with large arc-strong connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800596)