Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7
Publication Date
7-31-2021
Document Type
Article
Publication Title
Discrete Applied Mathematics
Volume
298
DOI
10.1016/j.dam.2021.03.019
First Page
80
Last Page
83
Abstract
Let G be an n-vertex graph with maximum degree Δ(G) and minimum degree δ(G). We give algorithms with complexity O(1.3158n−0.7Δ(G)) and O(1.32n−0.73Δ(G)) that determines if G is 3-colorable, when δ(G)≥8 and δ(G)≥7, respectively.
Funding Number
CMMI-1727743
Funding Sponsor
National Science Foundation
Keywords
Algorithms, Complexity, Proper coloring
Department
Mathematics and Statistics; Computer Science
Recommended Citation
Nicholas Crawford, Sogol Jahanbekam, and Katerina Potika. "Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7" Discrete Applied Mathematics (2021): 80-83. https://doi.org/10.1016/j.dam.2021.03.019
COinS
