首页|Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
We give a linear-time algorithm to decide 3-colorability of a triangle-free graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the coloring of a bounded number of vertices. (c) 2021 Elsevier Inc. All rights reserved.
NSTL
Elsevier
