Pages that link to "Item:Q3119055"
From MaRDI portal
The following pages link to Graphs with chromatic numbers strictly less than their colouring numbers (Q3119055):
Displaying 6 items.
- Chromatic numbers of competition graphs (Q1805322) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- On the complexity of the circular chromatic number (Q3159379) (← links)
- (Q4379734) (← links)
- Graphs with least number of colorings (Q4842706) (← links)
- (Q5492615) (← links)