z-logo
open-access-imgOpen Access
The Complexity of Grid Coloring
Author(s) -
Daniel Apon,
William Gasarch,
Kevin Lawler
Publication year - 2022
Publication title -
theory of computing systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.479
H-Index - 44
eISSN - 1433-0490
pISSN - 1432-4350
DOI - 10.1007/s00224-022-10098-5
Subject(s) - rectangle , grid , combinatorics , complete coloring , mathematics , computational complexity theory , greedy coloring , upper and lower bounds , list coloring , fractional coloring , discrete mathematics , algorithm , geometry , mathematical analysis , graph , line graph , graph power

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom