Decompositions of graphs into trees, forests, and regular subgraphs
From MaRDI portal
Publication:2342619
DOI10.1016/j.disc.2015.02.021zbMath1310.05167OpenAlexW2055026045MaRDI QIDQ2342619
Tommy R. Jensen, Saieed Akbari, Mark H. Siggers
Publication date: 29 April 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.02.021
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (7)
Decomposition of cubic graphs with a 2-factor consisting of three cycles ⋮ Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs ⋮ Decomposing graphs into a spanning tree, an even graph, and a star forest ⋮ An enhancement of Nash-Williams' theorem on edge arboricity of graphs ⋮ Decompositions of cubic traceable graphs ⋮ Edge decomposition of connected claw-free cubic graphs ⋮ Towards obtaining a 3-decomposition from a perfect matching
Cites Work
This page was built for publication: Decompositions of graphs into trees, forests, and regular subgraphs