The complexity of infinite \(H\)-colouring
From MaRDI portal
Publication:1333335
DOI10.1006/jctb.1994.1040zbMath0802.05038OpenAlexW2039793369MaRDI QIDQ1333335
Publication date: 28 November 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1040
Complexity of computation (including implicit computational complexity) (03D15) Coloring of graphs and hypergraphs (05C15) Word problems, etc. in computability and recursion theory (03D40) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)
Related Items
Graph homomorphisms with infinite targets, The complexity of restricted graph homomorphisms, On the distance and multidistance graph embeddability problem, Unnamed Item, Non-dichotomies in Constraint Satisfaction Complexity, An initial study of time complexity in infinite-domain constraint satisfaction, Constraint Satisfaction Problems with Infinite Templates, Fast left Kan extensions using the chase
