𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chromatic number of distance graphs generated by the sets {2,3,x,y}

✍ Scribed by Daphne Der-Fen Liu, Aileen Sutedja

Book ID
120694172
Publisher
Springer US
Year
2012
Tongue
English
Weight
495 KB
Volume
25
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A general upper bound for the cyclic chr
A general upper bound for the cyclic chromatic number of 3-connected plane graphs
✍ Hikoe Enomoto; Mirko HorňÑk πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 457 KB πŸ‘ 1 views

## Abstract The cyclic chromatic number of a plane graph __G__ is the smallest number Ο‡~__c__~(__G__) of colors that can be assigned to vertices of __G__ in such a way that whenever two distinct vertices are incident with a common face, they receive distinct colors. It was conjectured by Plummer an