Circular chromatic number of triangle-free hexagonal graphs

MaRDI QIDQ3515284zbMATH OpenFDO

Authors Janez Žerovnik, Petra Šparl

Publication date 29 July 2008

zbMATH Keywords

graph homomorphismcircular chromatic numbertriangle free hexagonal graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Circular chromatic number of triangle-free hexagonal graphs
• Homomorphisms of hexagonal graphs to odd cycles
• Circular colouring and graph homomorphism
• Circular chromatic number and edge-path replacement graph.
• Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract

Cited in

(1)

• Circular chromatic number of triangle-free hexagonal graphs

This page was built for publication: Circular chromatic number of triangle-free hexagonal graphs

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