scientific article; zbMATH DE number 4002120
From MaRDI portal
Publication:3754634
Recommendations
Cited in
(16)- On constructive methods in the theory of colour-critical graphs
- Hajós' theorem for list coloring
- Revisiting a theorem by Folkman on graph colouring
- Hajós and Ore constructions for digraphs
- Constructive generation of very hard 3-colorability instances
- Hajós theorem for colorings of edge-weighted graphs
- scientific article; zbMATH DE number 1256654 (Why is no real title available?)
- scientific article; zbMATH DE number 1953190 (Why is no real title available?)
- Hajós' theorem for list colorings of hypergraphs
- The Complexity of the Hajós Calculus
- Hajós-type constructions and neighborhood complexes
- Grassmann homomorphism and Hajós-type theorems
- Frozen development in graph coloring
- On a coloring conjecture of Hajós
- How to construct the symmetric cycle of length 5 using Haj\'os construction with an adapted Rank Genetic Algorithm
- Exponential lower bounds for the tree-like Hajós calculus
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754634)