Pages that link to "Item:Q1014408"
From MaRDI portal
The following pages link to Using stable sets to bound the chromatic number (Q1014408):
Displaying 6 items.
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Variations on the Roy-Gallai theorem (Q816578) (← links)
- On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem (Q943796) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs (Q1897443) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)