Paintability of complete bipartite graphs

DOI10.1016/j.dam.2024.01.010zbMath1530.05045OpenAlexW4391126713WikidataQ129372665 ScholiaQ129372665MaRDI QIDQ6193974

Masaki Kashima

Publication date: 14 February 2024

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

Full work available at URL: https://doi.org/10.1016/j.dam.2024.01.010

zbMATH Keywords

complete bipartite graphspaintabilityonline choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Chip games and paintability
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
• Three topics in online list coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Paintability of complete bipartite graphs