𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The circular chromatic index of some class 2 graphs

✍ Scribed by Adam Nadolski

Book ID
108113616
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
213 KB
Volume
307
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Circular chromatic index of Cartesian pr
Circular chromatic index of Cartesian products of graphs
✍ Douglas B. West; Xuding Zhu πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

## Abstract The __circular chromatic index__ of a graph __G__, written $\chi\_{c}'(G)$, is the minimum __r__ permitting a function $f : E(G)\rightarrow [0,r)$ such that $1 \le | f(e)-f(e')|\le r - 1$ whenever __e__ and $e'$ are incident. Let $G = H$ β–‘ $C\_{2m +1}$, where β–‘ denotes Cartesian product

Circular chromatic numbers of some reduc
Circular chromatic numbers of some reduced Kneser graphs
✍ Ko-Wei Lih; Daphne Der-Fen Liu πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 75 KB

## Abstract The vertex set of the reduced Kneser graph KG~2~(__m,2__) consists of all pairs {__a,b__} such that __a, b__Ξ΅{1,2,…,__m__} and 2≀|__a__βˆ’__b__|≀__m__βˆ’2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if __m__β‰₯4 __and m__β‰ 5, then the circular chromatic number

Circular chromatic index of graphs of ma
Circular chromatic index of graphs of maximum degree 3
✍ Peyman Afshani; Mahsa Ghandehari; Mahya Ghandehari; Hamed Hatami; Ruzbeh Tusserk πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

## Abstract This paper proves that if __G__ is a graph (parallel edges allowed) of maximum degree 3, then Ο‡β€²~__c__~(__G__) ≀ 11/3 provided that __G__ does not contain __H__~1~ or __H__~2~ as a subgraph, where __H__~1~ and __H__~2~ are obtained by subdividing one edge of __K__ (the graph with three

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