Keyword

graph coloring

Description: A combinatorial problem that assigns colors to graph vertices or other elements under constraints, with applications including scheduling and frequency assignment.

Primary topic: Advanced Graph Theory Research (39%)

Wikidata ID: wiki/Q504843

OpenAlex ID: keywords/graph-coloring

Tabu Search—Part I

1989 · Fred Glover · INFORMS journal on computing · 5,235

Modern Graph Theory

1998 · Béla Bollobás · Graduate texts in mathematics · 3,780

On the random-cluster model

1972 · C.M. Fortuin, P.W. Kasteleyn · Physica · 1,743

New methods to color the vertices of a graph

1979 · Daniel Brélaz · Communications of the ACM · 1,567

PDF

Unit disk graphs

1990 · Brent N. Clark, Charles J. Colbourn, et al. · Discrete Mathematics · 1,429

Frequency assignment: Theory and applications

1980 · W.K. Hale · Proceedings of the IEEE · 1,348

Coloring of commutative rings

1988 · Istvan Beck · Journal of Algebra · 1,232

PDF

Graph coloring problems

1995 · Choice Reviews Online · 1,209

A Course in Combinatorics

2001 · J. H. van Lint, R. M. Wilson · Cambridge University Press eBooks · 1,185

A new method for solving hard satisfiability problems

1992 · Bart Selman, Hector J. Levesque, et al. · 1,185

Algorithmic graph theory and perfect graphs

1980 · M.J. Rijckaert · Journal of Computational and Applied Mathematics · 1,162

Every planar map is four colorable

1976 · K. Appel, W. Haken · Bulletin of the American Mathematical Society · 1,134

PDF

Algorithmic Graph Theory and Perfect Graphs

1980 · Elsevier eBooks · 1,130

The NP-Completeness of Edge-Coloring

1981 · Ian Holyer · SIAM Journal on Computing · 1,120

On colouring the nodes of a network

1941 · R. L. Brooks · Mathematical Proceedings of the Cambridge Philosophical Society · 1,052

Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem

1971 · H. N. V. Temperley, Elliott H Lieb · Proceedings of the Royal Society of London A Mathematical and Physical Sciences · 1,002

A Contribution to the Theory of Chromatic Polynomials

1954 · W. T. Tutte · Canadian Journal of Mathematics · 997

PDF

On the hardness of approximating minimization problems

1994 · Carsten Lund, Mihalis Yannakakis · Journal of the ACM · 896

PDF

Every planar map is four colorable. Part I: Discharging

1977 · K. Appel, W. Haken · Illinois Journal of Mathematics · 890

PDF

Advanced Combinatorics: The Art of Finite and Infinite Expansions

1974 · Louis Comtet, J.W. Nienhuys · CERN Document Server (European Organization for Nuclear Research) · 883

Locality in Distributed Graph Algorithms

1992 · Nathan Linial · SIAM Journal on Computing · 879

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

1991 · David S. Johnson, Cecilia R. Aragon, et al. · Operations Research · 845

Algorithmic graph theory

1985 · Alan Gibbons · 835

Graphs on Surfaces

2001 · Bojan Mohar, Carsten Thomassen · Medical Entomology and Zoology · 831

Kneser's conjecture, chromatic number, and homotopy

1978 · L Lovász · Journal of Combinatorial Theory Series A · 795

PDF

Works count: 29,480

Citation count: 290,700