ℋ-Colouring Dichotomy in Proof Complexity

DOI10.1093/LOGCOM/EXAB028MaRDI QIDQ3382818zbMATH OpenOpenAlexFDO

Authors Azza M. Gaysin

Publication date 22 September 2021

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2004.13149

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• H-coloring dichotomy revisited
• Dichotomy for bounded degree \(H\)-colouring
• A new proof of the \(H\)-coloring dichotomy
• On the complexity of H-coloring
• Colouring, constraint satisfaction, and complexity

Cited in

(2)

• Deciding Relaxed Two-Colourability: A Hardness Jump
• H-coloring Dichotomy in Proof Complexity

This page was built for publication: ℋ-Colouring Dichotomy in Proof Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382818)