Supereulerian digraphs with large arc-strong connectivity
DOI10.1002/JGT.21885zbMATH Open1333.05132OpenAlexW1930841953MaRDI QIDQ2800596FDOQ2800596
Authors: 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
Recommendations
- Super-arc-connectivity properties of strongly connected digraphs
- Super-arc-connected and super-connected total digraphs
- Super-connected arc-transitive digraphs
- Sufficient conditions for super-arc-connected digraphs
- The superconnectivity of large digraphs and graphs
- scientific article; zbMATH DE number 7491374
- 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
- Super connectivity and super arc connectivity of the Mycielskian of a digraph.
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 (18)
- Subeulerian oriented graphs
- Title not available (Why is that?)
- Symmetric core and spanning trails in directed networks
- Vertex degree sums for supereulerian bipartite digraphs
- Matching and spanning trails in digraphs
- Super-connected arc-transitive digraphs
- Supereulerian digraphs with given diameter
- Supereulerian bipartite digraphs
- Spanning Eulerian subdigraphs in jump digraphs
- Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs
- Supereulerian extended 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
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)
