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

DOI10.1016/j.disc.2020.111839zbMath1437.05203OpenAlexW3008129046MaRDI QIDQ2174583

Chuixiang Zhou, Shun Zhou, Mengmeng Xie

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

decompositionspanning tree2-factorcubic graphs

Mathematics Subject Classification ID

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

Related Items (1)

Towards obtaining a 3-decomposition from a perfect matching

Cites Work

• Decomposing plane cubic graphs
• Decompositions of cubic traceable graphs
• Decompositions of graphs into trees, forests, and regular subgraphs
• Decomposing planar cubic graphs
• On Compatible Normal Odd Partitions in Cubic Graphs

This page was built for publication: Decomposition of cubic graphs with a 2-factor consisting of three cycles