Covering and packing in graphs IV: Linear arboricity

DOI10.1002/NET.3230110108zbMath0479.05027DBLPjournals/networks/AkiyamaEH81OpenAlexW2066364084WikidataQ55969521 ScholiaQ55969521MaRDI QIDQ3936755

Jin Akiyama, Geoffrey Exoo, Frank Harary

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230110108

zbMATH Keywords

linear arboricitylinear forest

Mathematics Subject Classification ID

Trees (05C05)

Related Items (47)

Unnamed Item ⋮ A Planar linear arboricity conjecture ⋮ LIST POINT ARBORICITY OF GRAPHS ⋮ Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) ⋮ The linear arboricity of planar graphs without 5-, 6-cycles with chords ⋮ Path covering problems and testing of printed circuits ⋮ Covering and packing in graphs. V. Mispacking subcubes in hypercubes ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ The linear arboricity of graphs ⋮ The \(k\)-strong induced arboricity of a graph ⋮ An efficient case for computing minimum linear arboricity with small maximum degree ⋮ Rainbow subgraphs in Hamiltonian cycle decompositions of complete 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 ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Linear arboricity of degenerate graphs ⋮ Three ways to cover a graph ⋮ A decomposition method on solving the linear arboricity conjecture ⋮ On the linear arboricity of graphs with treewidth at most four ⋮ Almost Every Graph can be Covered by Linear Forests ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ Some problems about linear arboricity ⋮ The linear arboricity of planar graphs with maximum degree at least 5 ⋮ On the linear arboricity of graphs embeddable in surfaces ⋮ Partitioning regular graphs into equicardinal linear forests ⋮ Towards the linear arboricity conjecture ⋮ An introduction to the discharging method via graph coloring ⋮ A note on the arboricity of graphs ⋮ Inapproximability of maximal strip recovery ⋮ Linear arboricity of regular digraphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ The linear arboricity of planar graphs with no short cycles ⋮ The conjunction of the linear arboricity conjecture and Lovász's path partition theorem ⋮ Unnamed Item ⋮ The list linear arboricity of planar graphs with 7-cycles containing at most two chords ⋮ Finding occurrences of protein complexes in protein-protein interaction graphs ⋮ 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 ⋮ The Local Queue Number of Graphs with Bounded Treewidth ⋮ Partitioning circulant graphs into isomorphic linear forests ⋮ Probabilistic methods in coloring and decomposition problems

Cites Work

• The Subgraph Problem
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: Covering and packing in graphs IV: Linear arboricity