The complexity of infinite H-colouring
From MaRDI portal
Publication:1333335
Recommendations
- On the complexity of H-coloring
- scientific article; zbMATH DE number 4008418
- scientific article; zbMATH DE number 434895
- Complexity of correspondence \(H\)-colourings
- scientific article; zbMATH DE number 1953088
- The colouring number of infinite graphs
- Essentially infinite colourings of hypergraphs
- The complexity of \(H\)-colouring of bounded degree graphs
- Essentially Infinite Colourings of Graphs
- On the complexity of \(H\)-colouring planar graphs
Cited in
(10)- The complexity of restricted graph homomorphisms
- Graph homomorphisms with infinite targets
- scientific article; zbMATH DE number 434895 (Why is no real title available?)
- Constraint Satisfaction Problems with Infinite Templates
- Non-dichotomies in Constraint Satisfaction Complexity
- Endomorphisms of Cayley digraphs of rectangular groups
- An initial study of time complexity in infinite-domain constraint satisfaction
- Fast left Kan extensions using the chase
- scientific article; zbMATH DE number 4162940 (Why is no real title available?)
- On the distance and multidistance graph embeddability problem
This page was built for publication: The complexity of infinite \(H\)-colouring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333335)