The following pages link to Sum list coloring graphs (Q2502028):
Displaying 21 items.
- Lower bounds on the sum choice number of a graph (Q327690) (← links)
- The sum choice number of \(P_3 \square P_n\) (Q423925) (← links)
- Sum-paintability of generalized theta-graphs (Q497323) (← links)
- Sum list edge colorings of graphs (Q726650) (← links)
- Families of online sum-choice-greedy graphs (Q897232) (← links)
- Sum list colorings of wheels (Q897250) (← links)
- Sum choice numbers of some graphs (Q1025471) (← links)
- Online sum-paintability: the slow-coloring game (Q1699554) (← links)
- Comparison of sum choice number with chromatic sum (Q2032707) (← links)
- Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common (Q2175245) (← links)
- An infinite family of sum-paint critical graphs (Q2227994) (← links)
- Acyclic sum-list-colouring of cylinders (Q2244713) (← links)
- Sum choice number of generalized \(\theta\)-graphs (Q2401797) (← links)
- Bounds for the sum choice number (Q2413335) (← links)
- Online sum-paintability: slow-coloring of trees (Q2416431) (← links)
- Generalized sum List colorings of graphs (Q2416953) (← links)
- List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs (Q2811205) (← links)
- List colorings with distinct list sizes, the case of complete bipartite graphs (Q2851483) (← links)
- Sum-list-colouring of θ-hypergraphs (Q5066973) (← links)
- The interactive sum choice number of graphs (Q5915807) (← links)
- The interactive sum choice number of graphs (Q5919074) (← links)
