An infinite family of sum-paint critical graphs

DOI10.1007/S00373-020-02215-3MaRDI QIDQ2227994zbMATH OpenOpenAlexFDO

Authors Thomas Mahoney, Chad Wiley

Publication date 16 February 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-020-02215-3

zbMATH Keywords

online list coloringsum choosabilitysum paintability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Families of online sum-choice-greedy graphs
• Sum-paintability of generalized theta-graphs
• Three topics in online list coloring
• Online sum-paintability: the slow-coloring game
• Sum list coloring graphs

Cites work

• 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?)
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Sum list coloring 2 n arrays
• Sum list coloring block graphs
• Sum list coloring graphs
• Sum-paintability of generalized theta-graphs
• Three topics in online list coloring

Cited in

(5)

• Online sum-paintability: the slow-coloring game
• Online sum-paintability: slow-coloring of trees
• Graph painting and the Borel-de Siebenthal property
• Sum-paintability of generalized theta-graphs
• Families of online sum-choice-greedy graphs

This page was built for publication: An infinite family of sum-paint critical graphs

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