Families of online sum-choice-greedy graphs
From MaRDI portal
Publication:897232
DOI10.1007/S00373-014-1495-0zbMath1327.05119OpenAlexW2013393828MaRDI QIDQ897232
Charles Tomlinson, Thomas Mahoney, 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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
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
Cites Work
This page was built for publication: Families of online sum-choice-greedy graphs