Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs

DOI10.1016/j.dam.2020.01.016zbMath1461.05159arXiv1806.11009OpenAlexW3003624629MaRDI QIDQ2663993

Milad Ahanjideh, Elham Aboomahigir, Saieed Akbari

Publication date: 20 April 2021

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

Full work available at URL: https://arxiv.org/abs/1806.11009

zbMATH Keywords

claw-free graphplanar graphsubcubic graphHoffmann-Ostenhof's conjecture4-chordal subcubic graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) 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

• Research problems from the BCC22
• Decomposing plane cubic graphs
• Decompositions of graphs into trees, forests, and regular subgraphs
• Decomposing planar cubic graphs

This page was built for publication: Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs