scientific article
From MaRDI portal
Publication:3752419
zbMath0612.05050MaRDI QIDQ3752419
Publication date: 1986
Full work available at URL: https://eudml.org/doc/32257
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A Planar linear arboricity conjecture, 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, The linear arboricity of graphs, The list linear arboricity of graphs, On the path partition number of 6‐regular graphs, Minimum number of disjoint linear forests covering a planar graph, 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, A decomposition method on solving the linear arboricity conjecture, On the linear arboricity of graphs with treewidth at most four, On an \(f\)-coloring generalization of linear arboricity of multigraphs, Unnamed Item, Linear arboricity of digraphs, The linear arboricity of planar graphs with maximum degree at least 5, Unnamed Item, On the linear arboricity of graphs embeddable in surfaces, Towards the linear arboricity conjecture, An introduction to the discharging method via graph coloring, A note on the arboricity of graphs, The linear arboricity of planar graphs with no short cycles, Unnamed Item, Unnamed Item, The star arboricity of graphs, Linear \(k\)-arboricities on trees, The linear arboricity of \(K_5\)-minor free graphs, Note on linear arboricity of graphs with large girth
Cites Work
