Supereulerian digraphs
From MaRDI portal
Publication:2017061
Recommendations
Cites work
Cited in
(28)- Adamant digraphs
- Species on digraphs
- Locally dense supereulerian digraphs
- Symmetric core and spanning trails in directed networks
- Matching and spanning trails in digraphs
- Sufficient Ore type condition for a digraph to be supereulerian
- Supereulerian digraphs with given diameter
- Supereulerian digraphs with large arc-strong connectivity
- Ore-type degree condition of supereulerian digraphs
- scientific article; zbMATH DE number 5379347 (Why is no real title available?)
- Unit and proper bitolerance digraphs
- Supereulerian bipartite digraphs
- Supereulerian and bi-trailable strong product digraphs
- Supereulerian extended digraphs
- Supereulerian digraphs with forbidden induced subdigraphs containing short semi-paths
- Sufficient conditions for a digraph to be supereulerian
- Spanning Eulerian subdigraphs in jump digraphs
- Supereulerian digraphs with given local structures
- An approximation algorithm for the clustered path travelling salesman problem
- Subeulerian oriented graphs
- An approximation algorithm for the clustered path travelling salesman problem
- Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs
- Vertex degree sums for supereulerian bipartite digraphs
- Trails, paths and cycles of digraphs with _2-stable number 2
- A new condition on dominated pair degree sum for a digraph to be supereulerian
- Supereulerian oriented graphs with large arc-strong connectivity
- Dominated pair degree sum conditions of supereulerian digraphs
- Spanning Eulerian subdigraph in line digraphs
This page was built for publication: Supereulerian digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017061)