Circular chromatic number for iterated Mycielski graphs
From MaRDI portal
Publication:1877680
DOI10.1016/j.disc.2004.01.020zbMath1050.05054OpenAlexW2012032721MaRDI QIDQ1877680
Publication date: 19 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.01.020
Related Items (15)
DOMINATION PARAMETERS IN MYCIELSKI GRAPHS ⋮ Reformulated reciprocal degree distance of transformation graph ⋮ Degree and distance based topological indices of graphs ⋮ Total chromatic number of generalized Mycielski graphs ⋮ Edge-chromatic numbers of Mycielski graphs ⋮ Graph classes generated by Mycielskians ⋮ Connectivity of the Mycielskian of a graph ⋮ Inverse sum indeg index of graphs ⋮ Multicoloring and Mycielski construction ⋮ Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\) ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ Circular coloring and Mycielski construction ⋮ On topological indices of graph transformation ⋮ Connectivity of the Mycielskian of a digraph ⋮ Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian
Cites Work
- Circular chromatic numbers of Mycielski's graphs
- Star chromatic number
- Star chromatic numbers and products of graphs
- Circular chromatic number and Mycielski construction
- Acyclic graph coloring and the complexity of the star chromatic number
- Sur le coloriage des graphs
- Circular chromatic number and Mycielski graphs
- Circular chromatic number: A survey
This page was built for publication: Circular chromatic number for iterated Mycielski graphs