Results 121 to 130 of about 267 (133)

Algorithmic bounds for the chromatic number†

Optimization, 2008
Ingo Schiermeyer
exaly  

Every planar map is four colorable. Part I: Discharging

Illinois Journal of Mathematics, 1977
exaly  

A New Proof of the H-Coloring Dichotomy

SIAM Journal on Discrete Mathematics, 2010
Mark Siggers
exaly  

Every planar map is four colorable. Part II: Reducibility

Illinois Journal of Mathematics, 1977
exaly  

A state calculus for graph coloring

Illinois Journal of Mathematics, 2016
Louis H Kauffman
exaly  

Counterexamples to Hedetniemi's conjecture

Annals of Mathematics, 2019
exaly  

Finitary coloring

Annals of Probability, 2017
David B Wilson, Oded Schramm
exaly  

Every planar graph has an acyclic 8-coloring

Duke Mathematical Journal, 1974
exaly  

A New Upper Bound for the Irregularity Strength of Graphs

SIAM Journal on Discrete Mathematics, 2011
Florian Pfender
exaly  

The existence of unavoidable sets of geographically good configurations

Illinois Journal of Mathematics, 1976
exaly