Edge colourings and qualitative representations of chromatic algebras
From MaRDI portal
Publication:6171755
DOI10.1007/s10801-023-01251-5arXiv2201.03098MaRDI QIDQ6171755
Badriah Al-Juaid, Tomasz Kowalski, Marcel Jackson, Unnamed Author
Publication date: 18 July 2023
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.03098
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Sum-free cyclic multi-bases and constructions of Ramsey algebras
- Relation algebras by games
- Representability of Ramsey relation algebras
- Relation algebras and projective geometries
- Relation algebras
- Small representations of the relation algebra \(\mathcal E_{n+1}(1,2,3)\)
- Algebraic foundations for qualitative calculi and networks
- So, what exactly is a qualitative calculus?
- On representable relation algebras
- Representability is not decidable for finite relation algebras
- Some Varieties Containing Relation Algebras
- 401 and beyond: improved bounds and algorithms for the Ramsey algebra search
- Introduction to Relation Algebras
- On the maximal triangle-free edge-chromatic graphs in three colors
- The Nonexistence of Certain Finite Projective Planes
- On the interval containing at least one prime number
- Combinatorial Relations and Chromatic Graphs
This page was built for publication: Edge colourings and qualitative representations of chromatic algebras