Circular chromatic number and a generalization of the construction of Mycielski.
From MaRDI portal
Publication:1417963
DOI10.1016/S0095-8956(03)00070-4zbMath1037.05022OpenAlexW1985826196MaRDI QIDQ1417963
Guohua Gu, Wensong Lin, Peter Che Bor Lam, Zeng Min Song
Publication date: 6 January 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00070-4
Related Items (14)
Connectivity of the generalised Mycielskian of digraphs ⋮ Total chromatic number of generalized Mycielski graphs ⋮ Anti-Ramsey problems in the Mycielskian of a cycle ⋮ Connectivity of the Mycielskian of a graph ⋮ Multicoloring and Mycielski construction ⋮ Colorful subgraphs in Kneser-like graphs ⋮ Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\) ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ Several parameters of generalized Mycielskians ⋮ Connectivity of the Mycielskian of a digraph ⋮ Unnamed Item ⋮ On strict strong coloring of graphs ⋮ On cylindrical graph construction and its applications ⋮ \(b\)-coloring of the Mycielskian of some classes of graphs
Cites Work
- Unnamed Item
- Circular chromatic numbers of Mycielski's graphs
- Some theorems concerning the star chromatic number of a graph
- A note on the star chromatic number
- Star chromatic number
- Star chromatic numbers and products of graphs
- The star chromatic number of a graph
- The circular chromatic number of the Mycielskian ofGdk
- Star chromatic numbers of some planar graphs
- Sur le coloriage des graphs
- Circular chromatic number: A survey
This page was built for publication: Circular chromatic number and a generalization of the construction of Mycielski.