✦ LIBER ✦

Planar Graphs with Circular Chromatic Numbers between 3 and 4

✍ Scribed by Xuding Zhu

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 284 KB
Volume: 76
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1999.1900

No coin nor oath required. For personal study only.

✦ Synopsis

This paper proves that for every rational number r between 3 and 4, there exists a planar graph G whose circular chromatic number is equal to r. Combining this result with a recent result of Moser, we arrive at the conclusion that every rational number r between 2 and 4 is the circular chromatic number of a planar graph.

📜 SIMILAR VOLUMES

Fractional chromatic number and circular

Fractional chromatic number and circular chromatic number for distance graphs with large clique size

✍ Daphne Der-Fen Liu; Xuding Zhu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract An Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005. Let __M__ be a set of positive integers. The distance graph generated by __M__, denoted by __G__(__Z, M__), has the set __Z__ of all integers as the vertex set, and edges __ij__ whenever |__i__

Circular chromatic number of distance gr

Circular chromatic number of distance graphs with distance sets of cardinality 3

✍ Xuding Zhu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

## Abstract Suppose __D__ is a subset of __R__^+^. The distance graph __G__(__R, D__) is the graph with vertex set __R__ in which two vertices __x__,__y__ are adjacent if |__x__−__y__| ∈ __D__. This study investigates the circular chromatic number and the fractional chromatic number of distance gra

K4-free graphs with no odd hole: Even pa

K4-free graphs with no odd hole: Even pairs and the circular chromatic number

✍ Yori Zwols 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

An odd hole in a graph is an induced cycle of odd length at least five. In this article we show that every imperfect K 4 -free graph with no odd hole either is one of two basic graphs, or has an even pair or a clique cutset. We use this result to show that every K 4 -free graph with no odd hole has

D. Liu and X. Zhu, Erratum to: “Fraction

D. Liu and X. Zhu, Erratum to: “Fractional chromatic number and circular chromatic number for distance graphs with large clique size”. Journal of Graph Theory47(2) 2004, 129–146

✍ Daphne Der-Fen Liu; Xuding Zhu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 45 KB

## Abstract The original article to which this Erratum refers was published in Journal of Graph Theory 47:129–146,2004.