A reduction procedure for coloring perfect K4-free graphs
Journal of Combinatorial Theory Series B
On the NP-completeness of the k-colorability problem for triangle-free graphs
Discrete Mathematics
New methods to color the vertices of a graph
Communications of the ACM
The 3-Colorability Problem on Graphs with Maximum Degree Four
SIAM Journal on Computing
Colorability of Planar Graphs with Isolated Nontriangular Faces
Graphs and Combinatorics
Linear algorithm for 3-coloring of locally connected graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
| Hi-index | 0.00 |
We present a linear algorithm for 3-coloring of locally connected graphs.