On linear k-arboricity

DOI10.1016/0012-365X(84)90075-XzbMath0556.05054OpenAlexW2039274034MaRDI QIDQ761470

Jean-Claude Bermond, Michel A. Habib, Bernard Peroche, Jean-Luc Fouquet

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90075-x

zbMATH Keywords

pathscomplete graphscubic graphslinear arboricityedge-coloringsedge-decompositionsresolvable graph designs

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

On the linearK-arboricity of cubic graphs, An improved upper bound on the linear 2-arboricity of 1-planar graphs, Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles, Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph, On the linear \(k\)-arboricity of cubic graphs, The linear arboricity of graphs, On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\), Combinatorics. Abstracts from the workshop held January 1--7, 2023, Bounded size components -- partitions and transversals., The linear 2-arboricity of IC-planar graphs, The linear 2-arboricity of sparse graphs, Linear 2-arboricity of toroidal 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, On isomorphic linear partitions in cubic graphs, The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\), On isomorphic linear partitions in cubic graphs, A note on the linear 2-arboricity of planar graphs, On monochromatic component size for improper colourings, A structural theorem for planar graphs with some applications, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, 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, On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks, Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree, Linear \(k\)-arboricities on trees, New lower bounds on the size-Ramsey number of a path, Light structures in 1-planar graphs with an application to linear 2-arboricity, 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, On linear 2-arboricity of certain graphs, The linear 2-arboricity of 1-planar graphs without 3-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some problems about linear arboricity
• Graph decompositions, handcuffed prisoners and balanced p-designs
• La k-Arboricité Linéaire Des Arbres
• The linear arboricity of some regular graphs
• A remark on the factor theorems of lovász and tutte
• The NP-Completeness of Edge-Coloring
• Complexité de l'arboricité linéaire d'un graphe
• The Subgraph Problem
• The complexity of satisfiability problems
• COVERING AND PACKING IN GRAPHS, I.