Pages that link to "Item:Q845732"

The following pages link to An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732):

Displaying 8 items.

• An approximate algorithm for the chromatic number of graphs (Q283679) (← links)
• Report 7/2006: Algorithmic Graph Theory (February 12th -- February 18th, 2006) (Q873854) (← links)
• \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
• A randomised heuristical algorithm for estimating the chromatic number of a graph (Q1262784) (← links)
• Approximating the independence number and the chromatic number in expected polynomial time (Q1598877) (← links)
• Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
• Approximating the chromatic polynomial (Q2799869) (← links)
• Exact and approximative algorithms for coloring G(n,p) (Q4736774) (← links)