Properties of an Approximability-related Parameter on Circular Complete Graphs

DOI10.1016/j.endm.2009.11.020zbMath1268.05198OpenAlexW2045685783MaRDI QIDQ2840526

Johan Thapper, Tommy Färnqvist, Robert Engström, Peter Jonsson

Publication date: 19 July 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.020

zbMATH Keywords

graph theorycombinatorial optimisationcircular colouringgraph \(H\)-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• The circular chromatic number of series-parallel graphs of large odd girth
• Homomorphisms from sparse graphs with large girth.
• Approximability Distance in the Space of H-Colourability Problems
• Fractional covering by cuts
• How to Round Any CSP
• Circular chromatic number: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Properties of an Approximability-related Parameter on Circular Complete Graphs