Families of online sum-choice-greedy graphs

DOI10.1007/S00373-014-1495-0MaRDI QIDQ897232zbMATH OpenOpenAlexFDO

Authors Thomas Mahoney, Charles Tomlinson, Jennifer I. Wise

Publication date 17 December 2015

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

Full work available at URL https://doi.org/10.1007/s00373-014-1495-0

zbMATH Keywords

lister/painter gameonline sum choosabilityouterplanarpaintabilitysum-paintability

Mathematics Subject Classification ID

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

Recommendations

• An infinite family of sum-paint critical graphs
• Sum-paintability of generalized theta-graphs
• Sum list coloring graphs
• Sum list colorings of wheels
• Three topics in online list coloring

Cites work

• 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

(6)

• Online sum-paintability: the slow-coloring game
• An infinite family of sum-paint critical graphs
• Online sum-paintability: slow-coloring of trees
• Sum-paintability of generalized theta-graphs
• The interactive sum choice number of graphs
• The interactive sum choice number of graphs

This page was built for publication: Families of online sum-choice-greedy graphs

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