Families of online sum-choice-greedy graphs

DOI10.1007/S00373-014-1495-0zbMATH Open1327.05119OpenAlexW2013393828MaRDI QIDQ897232FDOQ897232

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

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

zbMATH Keywords

outerplanarpaintabilitylister/painter gameonline sum choosabilitysum-paintability

Mathematics Subject Classification ID

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

Cites Work

• Mr. Paint and Mrs. Correct
• Title not available (Why is that?)
• On-line list colouring of graphs
• Sum list coloring graphs
• Sum list coloring block graphs
• Sum list coloring \(2\times n\) arrays
• Three topics in online list coloring
• Sum-paintability of generalized theta-graphs

Cited In (6)

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

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)