scientific article; zbMATH DE number 3989394
From MaRDI portal
Publication:3752419
Recommendations
Cites work
- Complexité de l'arboricité linéaire d'un graphe II
- Covering and packing in graphs IV: Linear arboricity
- COVERING AND PACKING IN GRAPHS, I.
- 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 3312524 (Why is no real title available?)
- Some results on linear arboricity
- The linear arboricity of some regular graphs
Cited in
(34)- The linear arboricity of graphs
- A note on the arboricity of graphs
- Linear \(k\)-arboricities on trees
- The star arboricity of graphs
- Towards the linear arboricity conjecture
- The linear arboricity of \(K_5\)-minor free graphs
- 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 arboricity of some regular graphs
- Linear arboricity of digraphs
- scientific article; zbMATH DE number 4085704 (Why is no real title available?)
- 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?)
- The linear arboricity of planar graphs with maximum degree at least 5
- scientific article; zbMATH DE number 6889807 (Why is no real title available?)
- An introduction to the discharging method via graph coloring
- 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
- Linear arboricity of degenerate graphs
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- 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
- Linear arboricity of the tensor products of complete multipartite graphs
- Comparing the p-independence number of regular graphs to the q-independence number of their line graphs
- The linear arboricity of graphs with low treewidth
- The linear arboricity of planar graphs with no short cycles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752419)