Homomorphisms of hexagonal graphs to odd cycles

DOI10.1016/j.disc.2003.12.012zbMath1042.05054OpenAlexW2167993358MaRDI QIDQ1827797

Petra Šparl, Janez Žerovnik

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.12.012

zbMATH Keywords

\(H\)-coloringHomomorphismTriangle-free hexagonal graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of H-coloring
• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
• The complexity of \(H\)-colouring of bounded degree graphs
• On the complexity of the general coloring problem
• Channel assignment and weighted coloring
• Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
• Colorings and homomorphisms of degenerate and bounded degree graphs

This page was built for publication: Homomorphisms of hexagonal graphs to odd cycles