Pages that link to "Item:Q974757"
From MaRDI portal
The following pages link to A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757):
Displaying 7 items.
- Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- On linear-time algorithms for five-coloring planar graphs (Q1057278) (← links)
- Heuristic for rapidly four-coloring large planar graphs (Q1180542) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
- A heuristic for the coloring of planar graphs (Q2133446) (← links)