The following pages link to On the chromatic number of graphs (Q5942344):
Displaying 32 items.
- Chromatic number and complete graph substructures for degree sequences (Q485549) (← links)
- On the chromatic number of Toeplitz graphs (Q496679) (← links)
- The sigma chromatic number of a graph (Q607685) (← links)
- Design of highly synchronizable and robust networks (Q620598) (← links)
- On the quantum chromatic number of a graph (Q1010645) (← links)
- Chromatic number of finite and infinite graphs and hypergraphs (Q1059084) (← links)
- On the chromatic number of certain highly symmetric graphs (Q1062067) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- On the mean chromatic number (Q1322240) (← links)
- Relaxed chromatic numbers of graphs (Q1323496) (← links)
- On the chromatic number of the preferential attachment graph (Q2033902) (← links)
- Total difference chromatic numbers of graphs (Q2192426) (← links)
- Reflection on the coloring and chromatic numbers (Q2416518) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- On group chromatic number of graphs (Q2494108) (← links)
- Finding the chromatic number by means of critical graphs (Q2816102) (← links)
- (Q2994411) (← links)
- (Q3119321) (← links)
- On the First-Fit Chromatic Number of Graphs (Q3393424) (← links)
- (Q3818330) (← links)
- (Q4053658) (← links)
- (Q4294602) (← links)
- (Q4379734) (← links)
- (Q4470343) (← links)
- (Q4777296) (← links)
- On chromaticity of graphs (Q4846682) (← links)
- (Q5309532) (← links)
- Chromatic numbers in some graphs (Q5429791) (← links)
- (Q5532260) (← links)
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs (Q5693810) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence (Q5955196) (← links)
