Edge decomposition of connected claw-free cubic graphs

DOI10.1016/j.dam.2020.03.040zbMath1443.05158OpenAlexW3015472988MaRDI QIDQ777388

Qinghai Liu, Yanmei Hong, Nannan Yu

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.03.040

zbMATH Keywords

claw-free graphcubic graphHoffmann-Ostenhof's conjecture

Mathematics Subject Classification ID

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

Related Items (2)

Breaking symmetries with high dimensional graph invariants and their combination ⋮ Towards obtaining a 3-decomposition from a perfect matching

Cites Work

• Unnamed Item
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Research problems from the BCC22
• Decomposing plane cubic graphs
• Longest cycles in 3-connected cubic graphs
• How to determine the maximum genus of a graph
• Claw-free graphs---a survey
• Circumference of 3-connected cubic graphs
• Decompositions of cubic traceable graphs
• Decompositions of graphs into trees, forests, and regular subgraphs
• Longest Cycles in 3-Connected 3-Regular Graphs
• Decomposing planar cubic graphs

This page was built for publication: Edge decomposition of connected claw-free cubic graphs