The linear arboricity of some regular graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(51)- The linear arboricity of graphs
- Decompositions of graphs into forests with bounded maximum degree
- A note on the arboricity of graphs
- Linear \(k\)-arboricities on trees
- The star arboricity of graphs
- Partitioning circulant graphs into isomorphic linear forests
- Path covering problems and testing of printed circuits
- Towards the linear arboricity conjecture
- The linear arboricity of \(K_5\)-minor free graphs
- Edge coloring of signed graphs
- The list linear arboricity of planar graphs with 7-cycles containing at most two chords
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
- On the linear arboricity of graphs embeddable in surfaces
- The linear 6-arboricity of the complete bipartite graph \(K_{m,n}\)
- The linear arboricity of planar graphs of maximum degree seven is four
- 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 4085704 (Why is no real title available?)
- Linear arboricity of random regular graphs
- Note on linear arboricity of graphs with large girth
- scientific article; zbMATH DE number 90562 (Why is no real title available?)
- Minimum number of disjoint linear forests covering a planar graph
- scientific article; zbMATH DE number 566421 (Why is no real title available?)
- On the linearK-arboricity of cubic graphs
- The linear arboricity of planar graphs with maximum degree at least 5
- scientific article; zbMATH DE number 6889807 (Why is no real title available?)
- Arboreal structure and regular graphs of median-like classes
- Almost Every Graph can be Covered by Linear Forests
- An introduction to the discharging method via graph coloring
- The tree number of a graph with a given girth
- Graph theory (algorithmic, algebraic, and metric problems)
- The list linear arboricity of graphs
- On the path partition number of 6‐regular graphs
- Partitioning edges of a planar graph into linear forests and a matching
- Decomposing planar graphs into graphs with degree restrictions
- Linear arboricity of degenerate graphs
- Linear arboricity of 1-planar graphs
- A decomposition method on solving the linear arboricity conjecture
- Linear arboricity of IC-planar graphs
- On the linear arboricity of graphs with treewidth at most four
- On an f-coloring generalization of linear arboricity of multigraphs
- t-linear coloring in graphs with given small lenient-tree-width
- Towards the linear arboricity conjecture: graph products
- Linear arboricity of the tensor products of complete multipartite graphs
- On the triple arboricity of graphs
- The linear arboricity of graphs with low treewidth
- Linear arboricity of 1-planar graphs
- On linear k-arboricity
- The linear arboricity of planar graphs with no short cycles
This page was built for publication: The linear arboricity of some regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703914)
