Publication:4364807
From MaRDI portal
DOI<137::AID-JGT4>3.0.CO;2-S 10.1002/(SICI)1097-0118(199711)26:3<137::AID-JGT4>3.0.CO;2-SzbMath0884.05041MaRDI QIDQ4364807
No author found.
Publication date: 8 March 1998
05C15: Coloring of graphs and hypergraphs
Related Items
On the Multichromatic Number of s‐Stable Kneser Graphs, A combinatorial proof for the circular chromatic number of Kneser graphs, On the chromatic number of general Kneser hypergraphs, Multicoloring and Mycielski construction, Non-cover generalized Mycielski, Kneser, and Schrijver graphs, Circular coloring and Mycielski construction, On colorings of graph powers, Circular chromatic number of Kneser graphs, On the fractional chromatic number and the lexicographic product of graphs, Resource-sharing system scheduling and circular chromatic number, New results in \(t\)-tone coloring of graphs, Multiple \(L(j,1)\)-labeling of the triangular lattice, Circular colouring and algebraic no-homomorphism theorems, A new coloring theorem of Kneser graphs, On the Circular Chromatic Number of Graph Powers