Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Better coloring of 3-colorable graphs
Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda
We consider the problem of coloring a 3-colorable graph in polynomial time using as few colors as possible. This is one of the most challenging problems in graph algorithms. In thi…
math.CO2024
Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita +2
We prove that every cyclically 4-edge-connected cubic graph that can be embedded in the projective plane, with the single exception of the Petersen graph, is 3-edge-colorable. In o…