scientific article; zbMATH DE number 4008418
From MaRDI portal
Publication:3758852
Recommendations
Cited in
(31)- On the complexity of H-coloring
- The complexity of multicolouring
- A note on restricted H-colouring
- The complexity of some graph colouring problems
- The complexity of infinite \(H\)-colouring
- The complexity of restricted graph homomorphisms
- Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.
- The complexity of \(H\)-colouring of bounded degree graphs
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- The complexity of generalized graph colorings
- Closing complexity gaps for coloring problems on \(H\)-free graphs
- A generalization of the theorem of Lekkerkerker and Boland
- On the complexity of coloring areflexive \(h\)-ary relations with given permutation group
- A new proof of the \(H\)-coloring dichotomy
- Subdivision of the hierarchy of H-colorable graph classes by circulant graphs
- scientific article; zbMATH DE number 3913673 (Why is no real title available?)
- scientific article; zbMATH DE number 4101217 (Why is no real title available?)
- scientific article; zbMATH DE number 1983292 (Why is no real title available?)
- Structure Learning of H-colorings
- scientific article; zbMATH DE number 3999312 (Why is no real title available?)
- scientific article; zbMATH DE number 1834657 (Why is no real title available?)
- A Complexity Trichotomy for Approximately Counting List H -Colorings
- On the complexity of the flow coloring problem
- scientific article; zbMATH DE number 7561584 (Why is no real title available?)
- Polynomial graph-colorings
- Graph-Theoretic Concepts in Computer Science
- Logical Approaches to Computational Barriers
- Between 2- and 3-colorability
- On a coloring conjecture of Hajós
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
- H-coloring dichotomy revisited
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 Q3758852)
