On linear k-arboricity
DOI10.1016/0012-365X(84)90075-XzbMATH Open0556.05054OpenAlexW2039274034MaRDI QIDQ761470FDOQ761470
Authors: Jean-Claude Bermond, Jean-Luc Fouquet, M. A. Habib, B. Péroche 
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
Recommendations
- The linear arboricity conjecture for 3-degenerate graphs
- Linear \(k\)-arboricities on trees
- On the linear vertex-arboricity of a planar graph
- scientific article
- Linear arboricity and linear \(k\)-arboricity of regular graphs
- scientific article; zbMATH DE number 734483
- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
- The linear arboricity of planar graphs without 5-cycles with chords
- scientific article; zbMATH DE number 3873386
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
pathscubic graphscomplete graphslinear arboricityedge-coloringsedge-decompositionsresolvable graph designs
Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- The complexity of satisfiability problems
- Graph decompositions, handcuffed prisoners and balanced p-designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The linear arboricity of some regular graphs
- Title not available (Why is that?)
- Complexité de l'arboricité linéaire d'un graphe
- COVERING AND PACKING IN GRAPHS, I.
- Some problems about linear arboricity
- A remark on the factor theorems of lovász and tutte
- The Subgraph Problem
- La k-Arboricité Linéaire Des Arbres
Cited In (40)
- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
- Linear \(k\)-arboricities on trees
- Bounded size components -- partitions and transversals.
- On linear 2-arboricity of certain 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
- The linear \((n - 1)\)-arboricity of some lexicographic product graphs
- On the linearK-arboricity of cubic graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- The linear arboricity of graphs
- The linear 2-arboricity of IC-planar graphs
- An improved upper bound on the linear 2-arboricity of toroidal graphs
- Linear 2-arboricity of planar graphs with maximum degree nine
- Linear 2-arboricity of toroidal graphs
- The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)
- Title not available (Why is that?)
- On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
- Light structures in 1-planar graphs with an application to linear 2-arboricity
- On monochromatic component size for improper colourings
- On isomorphic linear partitions in cubic graphs
- On isomorphic linear partitions in cubic graphs
- Title not available (Why is that?)
- Isomorphic bisections of cubic graphs
- The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks
- On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles
- The linear 2-arboricity of 1-planar graphs without 3-cycles
- Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree
- New lower bounds on the size-Ramsey number of a path
- An improved upper bound on the linear 2-arboricity of planar graphs
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- A structural theorem for planar graphs with some applications
- Planar graphs without 5-cycles or without 6-cycles
- The linear 2-arboricity of sparse graphs
- Factorisation of regular graphs into forests of short paths
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
- Complexité de l'arboricité linéaire d'un graphe II
- A linear set view on KM-arcs
- On the linear \(k\)-arboricity of cubic graphs
- A note on the linear 2-arboricity of planar graphs
This page was built for publication: On linear k-arboricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761470)
