Edge-colouring graphs with local list sizes

DOI10.1016/j.jctb.2023.10.010zbMath1530.05038arXiv2007.14944OpenAlexW3046024813MaRDI QIDQ6187343

Luke Postle, Michelle Delcourt, Marthe Bonamy, Richard Lang

Publication date: 15 January 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

edge-colouringlist colouring conjecturelist colouringVizing's theoremlocal list colouring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the list edge coloring conjecture for complete graphs of prime degree
• List edge and list total colourings of multigraphs
• The list chromatic index of a bipartite multigraph
• Asymptotically good list-colorings
• Concentration of measure and isoperimetric inequalities in product spaces
• Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
• A unified approach to distance-two colouring of graphs on surfaces
• List edge colourings of some 1-factorable multigraphs
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Near-optimal list colorings
• Coloring triangle‐free graphs with local list sizes
• Maximum matching and a polyhedron with 0,1-vertices
• A local epsilon version of Reed's conjecture
• Asymptotically good edge correspondence colourings

This page was built for publication: Edge-colouring graphs with local list sizes