On the linear \(k\)-arboricity of cubic graphs
From MaRDI portal
Publication:1356680
DOI10.1016/0012-365X(95)00293-6zbMath0870.05036MaRDI QIDQ1356680
Bill Jackson, Nicholas C. Wormald
Publication date: 10 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (19)
On the linearK-arboricity of cubic graphs ⋮ Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles ⋮ On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\) ⋮ Relaxed two-coloring of cubic graphs ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Graph coloring with no large monochromatic components ⋮ Bounded size components -- partitions and transversals. ⋮ The linear 2-arboricity of sparse graphs ⋮ The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) ⋮ An improved upper bound on the linear 2-arboricity of planar graphs ⋮ Isomorphic bisections of cubic graphs ⋮ The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\) ⋮ A note on the linear 2-arboricity of planar graphs ⋮ On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles ⋮ Planar graphs without 5-cycles or without 6-cycles ⋮ Factorisation of regular graphs into forests of short paths ⋮ The linear \((n - 1)\)-arboricity of some lexicographic product graphs ⋮ Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 ⋮ THE LINEAR 6-ARBORICITY OF THE COMPLETE BIPARTITE GRAPH Km,n
Cites Work
This page was built for publication: On the linear \(k\)-arboricity of cubic graphs
