Decomposition of cubic graphs with a 2-factor consisting of three cycles
From MaRDI portal
Publication:2174583
DOI10.1016/J.DISC.2020.111839zbMATH Open1437.05203OpenAlexW3008129046MaRDI QIDQ2174583FDOQ2174583
Authors: Mengmeng Xie, Chuixiang Zhou, Shun Zhou 
Publication date: 21 April 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.111839
Recommendations
Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (12)
- Decompositions of cubic traceable graphs
- Decompositions of graphs into trees, forests, and regular subgraphs
- Title not available (Why is that?)
- Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck
- Title not available (Why is that?)
- On algorithmic certification of graph structures
- Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
- Decomposing planar cubic graphs
- On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture
- Edge decomposition of connected claw-free cubic graphs
- Decomposing plane cubic graphs
- Towards obtaining a 3-decomposition from a perfect matching
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)
