Supereulerian digraphs with given local structures
From MaRDI portal
Recommendations
Cites work
- A note on graphs spanned by Eulerian graphs
- A Note on Sub-Eulerian Graphs
- A reduction method to find spanning Eulerian subgraphs
- Digraphs. Theory, algorithms and applications
- Graph theory
- Quasi‐transitive digraphs
- Sufficient conditions for a digraph to be supereulerian
- Supereulerian digraphs
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
Cited in
(7)- Locally dense supereulerian digraphs
- Symmetric core and spanning trails in directed networks
- Degree condition for a digraph to be supereulerian
- Supereulerian digraphs with given diameter
- Subeulerian oriented graphs
- Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs
- Spanning Eulerian subdigraph in line digraphs
This page was built for publication: Supereulerian digraphs with given local structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964816)