Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
From MaRDI portal
Publication:2663993
Recommendations
Cites work
Cited in
(7)- Decompositions of graphs into trees, forests, and regular subgraphs
- On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture
- Some results on the reconstruction problems. p‐claw‐free, chordal, and p4‐reducible graphs
- Edge decomposition of connected claw-free cubic graphs
- Decomposing plane cubic graphs
- Claw-free graphs. IV: Decomposition theorem
- Towards obtaining a 3-decomposition from a perfect matching
This page was built for publication: Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663993)