A short proof that the list packing number of any graph is well defined

DOI10.1016/j.disc.2022.113185zbMath1527.05072arXiv2207.11868WikidataQ114671064 ScholiaQ114671064MaRDI QIDQ6091812

Jeffrey A. Mudrock

Publication date: 27 November 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

list coloringlist coloring conjecturelist packing

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The list chromatic index of a bipartite multigraph
• Some upper bounds on the total and list chromatic numbers of multigraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A short proof that the list packing number of any graph is well defined