Funder
National Research, Development and Innovation Office
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. Choice number of graphs: a probabilistic approach;Alon;Combin. Probab. Comput.,1992
2. Sum list coloring graphs;Berliner;Graphs Combin.,2006
3. Graphs that require many colors to achieve their chromatic sum;Erdős;Congr. Numer.,1990
4. A 27∕26-approximation algorithm for the chromatic sum coloring of bipartite graphs;Giaro,2002
5. Lower bounds on the sum choice number of a graph;Harant;Electron. Notes Discrete Math.,2016