Pages that link to "Item:Q1014408"

The following pages link to Using stable sets to bound the chromatic number (Q1014408):

Displaying 3 items.

• A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
• \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
• A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)