Pages that link to "Item:Q974757"

The following pages link to A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757):

Displaying 2 items.

• Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
• A heuristic for the coloring of planar graphs (Q2133446) (← links)