An improved bound for the linear arboricity conjecture

DOI10.1007/S00493-023-00024-9arXiv2008.04251OpenAlexW4380629273WikidataQ122966423 ScholiaQ122966423MaRDI QIDQ6081382

Luke Postle, Richard Lang

Publication date: 4 October 2023

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.04251

zbMATH Keywords

graph colouringlinear arboricityedge colouringlist colouring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A decomposition method on solving the linear arboricity conjecture ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs

This page was built for publication: An improved bound for the linear arboricity conjecture