Upper bound for linear arboricity

DOI10.1016/0893-9659(91)90054-YzbMath0732.05020OpenAlexW2081202192MaRDI QIDQ809087

Paul C. Kainen

Publication date: 1991

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(91)90054-y

zbMATH Keywords

linear arboricity

Mathematics Subject Classification ID

Trees (05C05)

Related Items (2)

Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ Acyclic edge-colorings of sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The linear arboricity of graphs
• Parallel concepts in graph theory
• Network Flow and Systems of Representatives
• Some results on linear arboricity
• On Representatives of Subsets
• An inequality for the chromatic number of a graph
• k-Degenerate Graphs

This page was built for publication: Upper bound for linear arboricity