Recommendations
Cites work
- Algorithmic aspects of linear k-arboricity
- Complexité de l'arboricité linéaire d'un graphe
- Covering and packing in graphs IV: Linear arboricity
- COVERING AND PACKING IN GRAPHS, I.
- scientific article; zbMATH DE number 3957129 (Why is no real title available?)
- scientific article; zbMATH DE number 3989394 (Why is no real title available?)
- scientific article; zbMATH DE number 3714952 (Why is no real title available?)
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 3777548 (Why is no real title available?)
- scientific article; zbMATH DE number 91047 (Why is no real title available?)
- scientific article; zbMATH DE number 734483 (Why is no real title available?)
- La k-Arboricité Linéaire Des Arbres
- Linear arboricity of digraphs
- On linear k-arboricity
- Some problems about linear arboricity
- Some results on linear arboricity
- The linear arboricity of graphs
- The linear arboricity of some regular graphs
- The NP-Completeness of Edge-Coloring
- The path-partition problem in bipartite distance-hereditary graphs
Cited in
(26)- Planar graphs without 5-cycles or without 6-cycles
- Algorithmic aspects of linear k-arboricity
- Edge-intersection graphs of boundary-generated paths in a grid
- Linear 2-arboricity of toroidal graphs
- Linear k-arboricity of Caylay graphs on abelian groups with given degree
- The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)
- Light structures in 1-planar graphs with an application to linear 2-arboricity
- The linear \((n - 1)\)-arboricity of some lexicographic product graphs
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
- scientific article; zbMATH DE number 6683591 (Why is no real title available?)
- scientific article; zbMATH DE number 5707458 (Why is no real title available?)
- scientific article; zbMATH DE number 409493 (Why is no real title available?)
- On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles
- An improved upper bound on the linear 2-arboricity of planar graphs
- The linear 2-arboricity of 1-planar graphs without 3-cycles
- The linear k-vertex-arboricity of Halin graph
- A note on the linear 2-arboricity of planar graphs
- The linear 2-arboricity of sparse graphs
- Bounds of the sum of edge lengths in linear arrangements of trees
- On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
- The linear 2-arboricity of IC-planar graphs
- Linear 2-arboricity of planar graphs with maximum degree nine
- On linear k-arboricity
- An improved upper bound on the linear 2-arboricity of 1-planar graphs
- Structural properties and tractability results for linear synteny
- The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
This page was built for publication: Linear \(k\)-arboricities on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1570841)