Pages that link to "Item:Q4265588"
From MaRDI portal
The following pages link to The circular chromatic number of the Mycielskian ofGdk (Q4265588):
Displaying 13 items.
- Multicoloring and Mycielski construction (Q932681) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Some star extremal circulant graphs (Q1408873) (← links)
- Circular chromatic number and a generalization of the construction of Mycielski. (Q1417963) (← links)
- Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← links)
- Several parameters of generalized Mycielskians (Q2495898) (← links)
- Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
- An analogue of Hajós' theorem for the circular chromatic number (Q2723478) (← links)
- On strict strong coloring of graphs (Q5013494) (← links)
- (Q5377027) (← links)
- The exponential growth of the packing chromatic number of iterated Mycielskians (Q6069170) (← links)