Back to Results
First PageMeta Content



An Application of Stahl’s Conjecture About the k-tuple Chromatic Numbers of Kneser Graphs Svata Poljak and Fred S. Roberts∗ Abstract A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G so th
Add to Reading List

Document Date: 2008-07-28 10:11:57


Open Document

File Size: 103,95 KB

Share Result on Facebook