Decomposition of cubic graphs with a 2-factor consisting of three cycles
From MaRDI portal
Publication:2174583
Recommendations
Cites work
Cited in
(15)- Towards obtaining a 3-decomposition from a perfect matching
- Decompositions of cubic traceable graphs
- Decompositions of graphs into trees, forests, and regular subgraphs
- Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
- Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck
- Decomposing planar cubic graphs
- scientific article; zbMATH DE number 861398 (Why is no real title available?)
- scientific article; zbMATH DE number 5027031 (Why is no real title available?)
- scientific article; zbMATH DE number 7644096 (Why is no real title available?)
- On algorithmic certification of graph structures
- On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture
- Hoffmann-Ostenhof's 3-decomposition conjecture
- The 3-decomposition conjecture of cubic graphs
- Edge decomposition of connected claw-free cubic graphs
- Decomposing plane cubic graphs
This page was built for publication: Decomposition of cubic graphs with a 2-factor consisting of three cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174583)