The following pages link to (Q4242948):
Displayed 14 items.
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) (Q968410) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- An upper bound for the chromatic number of line graphs (Q2461774) (← links)
- Upper bounds for the chromatic number of a graph (Q3439493) (← links)
- (Q4521547) (← links)
- A Ramsey‐type problem and the Turán numbers* (Q4539875) (← links)
- Hitting all maximum cliques with a stable set using lopsided independent transversals (Q5199419) (← links)
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947) (← links)
- Algorithmic bounds for the chromatic number† (Q5449019) (← links)