Using stable sets to bound the chromatic number
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3150488 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2156665 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- A generalization of the Gallai-Roy theorem
- Diperfect graphs
- Generalized colorings and avoidable orientations
- Mixed graph colorings
- Nombre chromatique et plus longs chemins d'un graphe
- On conjectures of Graffiti
Cited in
(7)- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- A supernodal formulation of vertex colouring with applications in course timetabling
- A generalization of Gale's lemma
- \([r,s,t]\)-coloring of trees and bipartite graphs
- On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem
- Variations on the Roy-Gallai theorem
This page was built for publication: Using stable sets to bound the chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014408)