Paintability of complete bipartite graphs

DOI10.1016/J.DAM.2024.01.010MaRDI QIDQ6193974zbMATH OpenOpenAlexWikidataFDO

Authors 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 graphsonline choosabilitypaintability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chip games and paintability
• Three topics in online list coloring
• Characterization of \((2m,m)\)-paintable graphs
• Strengthening \((a,b)\)-choosability results to \((a,b)\)-paintability
• On the Choice Numbers of Some Complete Multipartite Graphs

Cites work

• Chip games and paintability
• Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• scientific article; zbMATH DE number 637317 (Why is no real title available?)
• scientific article; zbMATH DE number 1156688 (Why is no real title available?)
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Three topics in online list coloring

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6193974)