Recommendations
Cites work
- A Class Of Abelian Groups
- A Reduction Method for Edge-Connectivity in Graphs
- Covering Graphs by Cycles
- Covering Multigraphs by Simple Circuits
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Flows and generalized coloring theorems in graphs
- Fulkerson's conjecture and circuit covers
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Shortest circuit covers of cubic graphs
- Shortest coverings of graphs with cycles
- Tutte's 3-flow conjecture and short cycle covers
Cited in
(19)- Cycle covering in bridgeless graphs
- Shortest circuit covers of cubic graphs
- Shortest circuit covers of signed graphs
- Integer 4-flows and cycle covers
- Circuit decompositions and shortest circuit coverings of hypergraphs
- A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs
- Short cycle covers on cubic graphs by choosing a 2-factor
- A note on shortest cycle covers of cubic graphs
- Short cycle covers of graphs with minimum degree three
- Sampling Edge Covers in 3-Regular Graphs
- Cycles intersecting edge-cuts of prescribed sizes
- 1-factor and cycle covers of cubic graphs
- Cubic graphs with no short cycle covers
- Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
- Small cycle covers of 3-connected cubic graphs
- Signed cycle double covers
- Cycle covers of cubic multigraphs
- Signed circuit 6-covers of signed K₄-minor-free graphs
- Shortest coverings of graphs with cycles
This page was built for publication: Short cycle covers of cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284099)
