Supereulerian digraphs with large arc-strong connectivity
From MaRDI portal
Publication:2800596
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.
Cites work
- scientific article; zbMATH DE number 1792587 (Why is no real title available?)
- A note on Hamiltonian circuits
- A note on graphs spanned by Eulerian graphs
- Digraphs
- Long Cycles in Digraphs
- Sufficient conditions for a digraph to be supereulerian
- Supereulerian digraphs
- Supereulerian graphs and matchings
- Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
- Supereulerian graphs: A survey
- TWO THEOREMS IN GRAPH THEORY
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
- The spanning subgraphs of eulerian graphs
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
Cited in
(18)- Symmetric core and spanning trails in directed networks
- Spanning eulerian subdigraphs in semicomplete digraphs
- Matching and spanning trails in digraphs
- Supereulerian digraphs with given diameter
- Degree condition for a digraph to be supereulerian
- Super-arc-connectivity properties of strongly connected digraphs
- A new condition on dominated pair degree sum for a digraph to be supereulerian
- Vertex degree sums for supereulerian bipartite digraphs
- Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs
- scientific article; zbMATH DE number 4103110 (Why is no real title available?)
- Subeulerian oriented graphs
- Spanning Eulerian subdigraphs in jump digraphs
- Supereulerian bipartite digraphs
- Supereulerian extended digraphs
- Trails, paths and cycles of digraphs with \(\alpha_2\)-stable number 2
- Locally dense supereulerian digraphs
- Supereulerian 3-path-quasi-transitive digraphs
- Super-connected arc-transitive 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)
