Sum-paintability of generalized theta-graphs

DOI10.1007/s00373-014-1441-1zbMath1322.05056OpenAlexW2130209831MaRDI QIDQ497323

James M. Carraher, Douglas B. West, Gregory J. Puleo, Thomas Mahoney

Publication date: 24 September 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-014-1441-1

zbMATH Keywords

choosabilitypaintabilitychoice numbergeneralized theta-graphlister/painter gamepaint number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Sum choice number of generalized \(\theta\)-graphs ⋮ Strong edge geodetic problem in networks ⋮ Bounds for the sum choice number ⋮ Online sum-paintability: slow-coloring of trees ⋮ Families of online sum-choice-greedy graphs ⋮ Slow coloring of \(3k\)-connected graphs ⋮ Online sum-paintability: the slow-coloring game ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs ⋮ An infinite family of sum-paint critical graphs ⋮ The interactive sum choice number of graphs ⋮ The interactive sum choice number of graphs ⋮ On list equitable total colorings of the generalized theta graph

Cites Work

• On-line list colouring of complete multipartite graphs
• Sum list coloring \(2\times n\) arrays
• Sum list coloring block graphs
• Families of online sum-choice-greedy graphs
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Towards an on-line version of Ohba's conjecture
• Three topics in online list coloring
• Sum list coloring graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Sum-paintability of generalized theta-graphs