HyColor, a hybrid heuristic for graph coloring, reports colorings no worse than FASTCOLOR, LS+I-DSATUR, and GC-SLIM on 194 of 209 benchmark graphs, strictly better on 34, and optimal on 128.
Haj ´os’ graph-coloring conjecture: variations and counterexam- ples,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
HyColor: An Efficient Heuristic Algorithm for Graph Coloring
HyColor, a hybrid heuristic for graph coloring, reports colorings no worse than FASTCOLOR, LS+I-DSATUR, and GC-SLIM on 194 of 209 benchmark graphs, strictly better on 34, and optimal on 128.