Homomorphisms of hexagonal graphs to odd cycles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1054727 (Why is no real title available?)
- scientific article; zbMATH DE number 1944137 (Why is no real title available?)
- scientific article; zbMATH DE number 1990841 (Why is no real title available?)
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
- Channel assignment and weighted coloring
- Colorings and homomorphisms of degenerate and bounded degree graphs
- Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
- On the complexity of H-coloring
- On the complexity of the general coloring problem
- The complexity of \(H\)-colouring of bounded degree graphs
Cited in
(7)- Circular chromatic number of triangle-free hexagonal graphs
- Mixing is hard for triangle-free reflexive graphs
- On colorings of graph powers
- Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph
- Equitable induced decompositions of twin graphs
- Circular chromatic number of triangle-free hexagonal graphs
- scientific article; zbMATH DE number 4008417 (Why is no real title available?)
This page was built for publication: Homomorphisms of hexagonal graphs to odd cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827797)