Pages that link to "Item:Q2768312"

The following pages link to Coloring \(k\)-colorable graphs using smaller palettes (Q2768312):

Displaying 9 items.

• An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
• Graphs with small chromatic numbers are easy to color (Q1116349) (← links)
• On-line coloring \(k\)-colorable graphs (Q1264277) (← links)
• (\(\Delta-k\))-critical graphs (Q1767668) (← links)
• Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085) (← links)
• Coloring 3-colorable graphs with o(n 1/5 ) colors (Q2965508) (← links)
• Almost all k-colorable graphs are easy to color (Q3811723) (← links)
• (Q4836302) (← links)
• Coloring graphs having few colorings over path decompositions (Q5369515) (← links)