Upper bound for linear arboricity

DOI10.1016/0893-9659(91)90054-YzbMATH Open0732.05020OpenAlexW2081202192MaRDI QIDQ809087FDOQ809087

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

• Network Flow and Systems of Representatives
• k-Degenerate Graphs
• On Representatives of Subsets
• Parallel concepts in graph theory
• The linear arboricity of graphs
• An inequality for the chromatic number of a graph
• Some results on linear arboricity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Bounds of the sum of edge lengths in linear arrangements of trees
• Title not available (Why is that?)
• Acyclic edge-colorings of sparse graphs
• Orientation‐based edge‐colorings and linear arboricity of multigraphs
• An improved bound for the linear arboricity conjecture

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)