Note on linear arboricity of graphs with large girth

DOI10.21136/CMJ.1991.102481MaRDI QIDQ4005688zbMATH OpenOpenAlexFDO

Authors Filip Guldan

Publication date 27 September 1992

Full work available at URL https://eudml.org/doc/13945

zbMATH Keywords

linear arboricitylinear forestpath

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Recommendations

• The linear arboricity of graphs
• Linear arboricity of random regular graphs
• Almost Every Graph can be Covered by Linear Forests
• Towards the linear arboricity conjecture
• The list linear arboricity of graphs

Cites work

• Covering and packing in graphs IV: Linear arboricity
• COVERING AND PACKING IN GRAPHS, I.
• scientific article; zbMATH DE number 4152425 (Why is no real title available?)
• scientific article; zbMATH DE number 3989394 (Why is no real title available?)
• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• scientific article; zbMATH DE number 3777548 (Why is no real title available?)
• On a problem of linear arboricity
• Some results on linear arboricity
• The linear arboricity of graphs
• The linear arboricity of some regular graphs

Cited in

(5)

• The linear arboricity of graphs
• Acyclic edge-colorings of sparse graphs
• Towards the linear arboricity conjecture
• Linear arboricity of regular digraphs
• Orientation‐based edge‐colorings and linear arboricity of multigraphs

This page was built for publication: Note on linear arboricity of graphs with large girth

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