Upper bound for linear arboricity

DOI10.1016/0893-9659(91)90054-YMaRDI QIDQ809087zbMATHOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• scientific article; zbMATH DE number 19193 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• k-Degenerate Graphs
• An inequality for the chromatic number of a graph
• Network Flow and Systems of Representatives
• On Representatives of Subsets
• Parallel concepts in graph theory
• Some results on linear arboricity
• The linear arboricity of graphs

Cited in

(5)

• Acyclic edge-colorings of sparse graphs
• Orientation‐based edge‐colorings and linear arboricity of multigraphs
• An improved bound for the linear arboricity conjecture
• scientific article; zbMATH DE number 1123795 (Why is no real title available?)
• Bounds of the sum of edge lengths in linear arrangements of trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809087)