Circular chromatic numbers of Mycielski's graphs
From MaRDI portal
Publication:1301826
DOI10.1016/S0012-365X(99)00033-3zbMath0941.05026OpenAlexW2142109901MaRDI QIDQ1301826
Xuding Zhu, Gerard Jennhwa Chang, Ling-ling Huang
Publication date: 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00033-3
Related Items (33)
On indicated chromatic number of graphs ⋮ Circular chromatic number for iterated Mycielski graphs ⋮ DOMINATION PARAMETERS IN MYCIELSKI GRAPHS ⋮ Reformulated reciprocal degree distance of transformation graph ⋮ FURTHER RESULTS ON THE UPHILL DOMINATION OF GRAPHS ⋮ Connectivity of the generalised Mycielskian of digraphs ⋮ Degree and distance based topological indices of graphs ⋮ Total chromatic number of generalized Mycielski graphs ⋮ Vertex cut of a graph and connectivity of its neighbourhood complex ⋮ Anti-Ramsey problems in the Mycielskian of a cycle ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ Edge-chromatic numbers of Mycielski graphs ⋮ Graph classes generated by Mycielskians ⋮ Connectivity of the Mycielskian of a graph ⋮ Some star extremal circulant graphs ⋮ Circular chromatic number and a generalization of the construction of Mycielski. ⋮ Inverse sum indeg index of graphs ⋮ Multicoloring and Mycielski construction ⋮ Circular chromatic numbers of distance graphs with distance sets missing multiples ⋮ Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\) ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ Circular coloring and Mycielski construction ⋮ The generalized 3-connectivity of the Mycielskian of a graph ⋮ Several parameters of generalized Mycielskians ⋮ K4-free graphs with no odd hole: Even pairs and the circular chromatic number ⋮ On topological indices of graph transformation ⋮ Connectivity of the Mycielskian of a digraph ⋮ Coloring-flow duality of embedded graphs ⋮ Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian ⋮ Unnamed Item ⋮ Planar graphs with circular chromatic numbers between 3 and 4 ⋮ On strict strong coloring of graphs ⋮ On cylindrical graph construction and its applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs whose circular chromatic number equals the chromatic number
- Circular chromatic numbers and fractional chromatic numbers of distance graphs
- Star-extremal graphs and the lexicographic product
- Circular chromatic numbers of distance graphs with distance sets missing multiples
- Star chromatic numbers of graphs
- A note on the star chromatic number
- Star chromatic number
- Star chromatic numbers and products of graphs
- The star chromatic number of a graph
- On (k,d)-colorings and fractional nowhere-zero flows
- Circular colouring and graph homomorphism
- The circular chromatic number of the Mycielskian ofGdk
- Acyclic graph coloring and the complexity of the star chromatic number
- The fractional chromatic number of mycielski's graphs
- Fractional colorings with large denominators
- Sur le coloriage des graphs
- Circular chromatic number: A survey
This page was built for publication: Circular chromatic numbers of Mycielski's graphs
