Linear arboricity of regular digraphs
type: Item
instance of: scholarly article
title: Linear arboricity of regular digraphs
zbMATH Open document ID: 1367.05087
author: Weihua He
author: Hao Li
author: Yandong Bai
author: Qiang Sun
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 6756282
zbMATH Keywords: linear arboricity
zbMATH Keywords: digraph
zbMATH Keywords: Lovász local lemma
zbMATH Keywords: random regular digraphs
MaRDI profile type: Publication
full work available at URL: s10114-016-5071-9
OpenAlex ID: W2526484191
cites work: Covering and packing in graphs IV: Linear arboricity
cites work: Probabilistic methods in coloring and decomposition problems
cites work: Q3197858
cites work: An Improvement of the Lovász Local Lemma via Cluster Expansion
cites work: Q3097395
cites work: Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
cites work: Hamilton Cycles in Random Regular Digraphs
cites work: Linear arboricity of digraphs
cites work: Improved bounds on coloring of graphs
cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
cites work: Bounded degree acyclic decompositions of digraphs.
DOI: 10.1007/S10114-016-5071-9
published in: Acta Mathematica Sinica, English Series
description: scientific article; zbMATH DE number 6756282