Circular chromatic number and Mycielski graphs
From MaRDI portal
Publication:5894920
DOI10.1007/s00493-004-0008-9zbMath1056.05057OpenAlexW2047439437MaRDI QIDQ5894920
No author found.
Publication date: 14 February 2005
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-004-0008-9
Related Items (17)
Circular chromatic number for iterated Mycielski graphs ⋮ DOMINATION PARAMETERS IN MYCIELSKI GRAPHS ⋮ COLORING AND GLOBAL DOMINATION IN GRAPHS ⋮ An analogue of Dirac's theorem on circular super-critical graphs ⋮ Total chromatic number of generalized Mycielski graphs ⋮ Edge-chromatic numbers of Mycielski graphs ⋮ On minimally circular-imperfect graphs ⋮ Multicoloring and Mycielski construction ⋮ \(T\)-colorings, divisibility and the circular chromatic number ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ Circular coloring and Mycielski construction ⋮ Several parameters of generalized Mycielskians ⋮ Circular vertex arboricity ⋮ Unnamed Item ⋮ Paths, cycles and circular colorings in digraphs ⋮ On strict strong coloring of graphs ⋮ Circular chromatic numbers of some reduced Kneser graphs
This page was built for publication: Circular chromatic number and Mycielski graphs
