On the General Coloring Problem
From MaRDI portal
Publication:3003475
DOI10.1007/978-3-642-19391-0_9zbMath1277.06004MaRDI QIDQ3003475
Publication date: 27 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19391-0_9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dualities and dual pairs in Heyting algebras
- Colorings and interpretations: a connection between graphs and grammar forms
- A survey on Hedetniemi's conjecture
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Lattices arising in categorial investigations of Hedetniemi's conjecture
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Generalized arithmetic
- Dense Hierarchies of Grammatical Families
- On the complexity of the general coloring problem
- Continuous Lattices and Domains
- Hedetniemi's conjecture---a survey