Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances

DOI10.1007/11856290_19zbMath1156.68615OpenAlexW1578642373MaRDI QIDQ5302914

Jian Zhang, Sheng Liu

Publication date: 15 January 2009

Published in: Artificial Intelligence and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11856290_19

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz ⋮ Hajós-Type Constructions and Neighborhood Complexes ⋮ Grassmann homomorphism and Hajós-type theorems

This page was built for publication: Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances