Pages that link to "Item:Q3990593"
From MaRDI portal
The following pages link to Graph coloring problems with applications in algebraic logic (Q3990593):
Displaying 8 items.
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- Representability of Ramsey relation algebras (Q745708) (← links)
- Contractions and minimal k-colorability (Q916670) (← links)
- Coloring terms to control equational reasoning (Q1367077) (← links)
- A reduced upper bound for an edge-coloring problem from relation algebra (Q2418558) (← links)
- Strongly representable atom structures of relation algebras (Q2781354) (← links)
- Relating the total domination number and the annihilation number of cactus graphs and block graphs (Q5225033) (← links)
- (Q5442528) (← links)