Linear arboricity of regular digraphs

DOI10.1007/s10114-016-5071-9zbMath1367.05087OpenAlexW2526484191MaRDI QIDQ2013125

Qiang Sun, Hao Li, Yan Dong Bai, Wei-Hua He

Publication date: 3 August 2017

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-016-5071-9

zbMATH Keywords

digraphlinear arboricityLovász local lemmarandom regular digraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ The linear arboricity of \(K_5\)-minor free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Probabilistic methods in coloring and decomposition problems
• Bounded degree acyclic decompositions of digraphs.
• An Improvement of the Lovász Local Lemma via Cluster Expansion
• Linear arboricity of digraphs
• Covering and packing in graphs IV: Linear arboricity
• Hamilton Cycles in Random Regular Digraphs

This page was built for publication: Linear arboricity of regular digraphs