San Skulrattanakulchai, Ph.D.
Affiliations: | 2002 | University of Colorado, Boulder, Boulder, CO, United States |
Area:
Computer ScienceGoogle:
"San Skulrattanakulchai"Parents
Sign in to add mentorHarold N. Gabow | grad student | 2002 | CU Boulder | |
(Efficient algorithms for graph coloring: Vertex, edge, list, total, and acyclic coloring.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Skulrattanakulchai S. (2004) Acyclic colorings of subcubic graphs Information Processing Letters. 92: 161-167 |
Gabow HN, Skulrattanakulchai S. (2002) Coloring algorithms on Subcubic Graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2387: 67-76 |
Gabow HN, Skulrattanakulchai S. (2002) Coloring algorithms on Subcubic Graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2387: 67-76 |
Skulrattanakulchai S. (2002) 4-edge-coloring graphs of maximum degree 3 in linear time Information Processing Letters. 81: 191-195 |
Skulrattanakulchai S. (2002) Δ-list vertex coloring in linear time Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2368: 240-248 |