Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph

MaRDI QIDQ3400664zbMATH OpenFDO

Authors Janez Žerovnik, Petra Šparl

Publication date 5 February 2010

zbMATH Keywords

Kneser graphhomomorphismPetersen graphH-coloringtriangle-free hexagonal graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Homomorphisms of hexagonal graphs to odd cycles
• scientific article; zbMATH DE number 4101217
• The complexity of restricted graph homomorphisms
• scientific article; zbMATH DE number 434895
• Circular chromatic number of triangle-free hexagonal graphs

Cited in

(1)

• Homomorphisms of hexagonal graphs to odd cycles

This page was built for publication: Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400664)