The complexity of grid coloring

DOI10.1007/s00224-022-10098-5OpenAlexW2280840659MaRDI QIDQ6109067

Kevin Lawler, Daniel Apon, William I. Gasarch

Publication date: 26 July 2023

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://scholarworks.uark.edu/etd/108

zbMATH Keywords

complexitycoloringgrid

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Coloring of graphs and hypergraphs (05C15) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Finding squares and rectangles in sets of points
• Ectremal binary matrices without constant 2-squares
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• On reductions of NP sets to sparse sets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of grid coloring