The list linear arboricity of graphs

DOI10.1002/jgt.22685zbMath1522.05125arXiv1712.05006OpenAlexW3165244533MaRDI QIDQ6056776

Ringi Kim, Luke Postle

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

linear arboricitylist coloringarboricity

Mathematics Subject Classification ID

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

Related Items

Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The linear arboricity of graphs
• A note on list arboricity
• The linear arboricity of series-parallel graphs
• Asymptotically good list-colorings
• Concentration of measure and isoperimetric inequalities in product spaces
• A Note on Vertex List Colouring
• The linear arboricity of planar graphs of maximum degree seven is four
• List linear arboricity of planar graphs
• The linear arboricity of some regular graphs
• Some results on linear arboricity
• Covering and packing in graphs IV: Linear arboricity
• COVERING AND PACKING IN GRAPHS, I.
• Decomposition of Finite Graphs Into Forests
• Graph colouring and the probabilistic method