Pages that link to "Item:Q3968953"
From MaRDI portal
The following pages link to Some Colouring Problems and their Complexity (Q3968953):
Displaying 5 items.
- Grassmann homomorphism and Hajós-type theorems (Q518115) (← links)
- Exponential lower bounds for the tree-like Hajós calculus (Q673010) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)