Decomposition of cubic graphs with a 2-factor consisting of three cycles

DOI10.1016/J.DISC.2020.111839MaRDI QIDQ2174583zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

decompositioncubic graphs2-factorspanning tree

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decomposing planar cubic graphs
• Towards obtaining a 3-decomposition from a perfect matching
• Decomposing plane cubic graphs
• Decompositions of graphs into trees, forests, and regular subgraphs
• Decompositions of cubic traceable graphs

Cites work

• Decomposing planar cubic graphs
• Decomposing plane cubic graphs
• Decompositions of cubic traceable graphs
• Decompositions of graphs into trees, forests, and regular subgraphs
• On compatible normal odd partitions in cubic graphs

Cited in

(12)

• Decompositions of cubic traceable graphs
• Decompositions of graphs into trees, forests, and regular subgraphs
• scientific article; zbMATH DE number 5027031 (Why is no real title available?)
• Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck
• scientific article; zbMATH DE number 7644096 (Why is no real title available?)
• 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)