𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The crossing number of the circular graph

✍ Scribed by Dengju Ma; Han Ren; Junjie Lu

Book ID
108113550
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
143 KB
Volume
304
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The book crossing number of a graph
The book crossing number of a graph
✍ Shahrokhi, Farhad; SzοΏ½kely, LοΏ½szlοΏ½ A.; SοΏ½kora, Ondrej; Vrt'o, Imrich πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 581 KB

Let G be a graph on n vertices and m edges. The book crossing number of G is defined as the minimum number of edge crossings when the vertices of G are placed on the spine of a k-page book and edges are drawn on pages, such that each edge is contained by one page. Our main results are t w o polynomi

On the circular chromatic number of circ
On the circular chromatic number of circular partitionable graphs
✍ Arnaud PΓͺcher; Xuding Zhu πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 168 KB

## Abstract This article studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs __G__ has $\chi\_ c (G) = \chi(G)$. A consequence of this result is that we obtain an infinite family of graphs __G__ with th

The circular chromatic number of series-
The circular chromatic number of series-parallel graphs
✍ Hell, Pavol; Zhu, Xuding πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 238 KB πŸ‘ 2 views

In this article, we consider the circular chromatic number Ο‡ c (G) of series-parallel graphs G. It is well known that series-parallel graphs have chromatic number at most 3. Hence, their circular chromatic numbers are at most 3. If a seriesparallel graph G contains a triangle, then both the chromati