Recommendations
Cites work
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- scientific article; zbMATH DE number 3458752 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- A note on minimum degree conditions for supereulerian graphs
- A reduction method to find spanning Eulerian subgraphs
- Double cycle covers and the petersen graph
- Edge-connectivity and edge-disjoint spanning trees
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Eulerian subgraphs and Hamilton-connected line graphs
- Flows and generalized coloring theorems in graphs
- Graph family operations
- Graph theory
- Graphs without spanning closed trails
- Spanning Eulerian subgraphs of 2-edge-connected graphs
- Super-Eulerian graphs of minimum degree at least \(4\).
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- Supereulerian graphs: A survey
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- The reduction of graph families closed under contraction
- The traveling salesman problem on cubic and subcubic graphs
- Video Deblurring Algorithm Using Accurate Blur Kernel Estimation and Residual Deconvolution Based on a Blurred-Unblurred Frame Pair
Cited in
(3)
This page was built for publication: Graphs with a 3-cycle-2-cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897268)
