Linear arboricity of random regular graphs

DOI10.1002/RSA.3240010405MaRDI QIDQ3970908zbMATH OpenOpenAlexFDO

Authors Colin McDiarmid, Bruce Reed

Publication date 25 June 1992

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240010405

zbMATH Keywords

random regular graphslinear arboricitylinear forestlinear arboricity conjecture

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 19179
• The linear arboricity of some regular graphs
• The linear arboricity of graphs
• scientific article; zbMATH DE number 4085704
• Linear arboricity and linear \(k\)-arboricity of regular graphs
• Linear arboricity of regular digraphs
• Publication:4863468
• scientific article; zbMATH DE number 866660
• scientific article; zbMATH DE number 140103
• Linear arboricity of digraphs

Cites work

• Graph theory with applications

Cited in

(10)

• Minimum number of disjoint linear forests covering a planar graph
• A decomposition method on solving the linear arboricity conjecture
• Note on linear arboricity of graphs with large girth
• Almost Every Graph can be Covered by Linear Forests
• Linear arboricity of regular digraphs
• The conjunction of the linear arboricity conjecture and Lovász's path partition theorem
• Towards the linear arboricity conjecture
• Linear arboricity of degenerate graphs
• Graph factors and factorization: 1985--2003: a survey
• The linear arboricity of some regular graphs

This page was built for publication: Linear arboricity of random regular graphs

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