Homomorphisms of hexagonal graphs to odd cycles

DOI10.1016/J.DISC.2003.12.012MaRDI QIDQ1827797zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph
• The complexity of restricted graph homomorphisms
• scientific article; zbMATH DE number 4008417
• scientific article; zbMATH DE number 4101217
• Exact algorithms for graph homomorphisms

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)