Premium
Note on a new coloring number of a graph
Author(s) -
Horák P.,
Širáň J.
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040113
Subject(s) - combinatorics , mathematics , fractional coloring , edge coloring , list coloring , graph power , vertex (graph theory) , natural number , graph , complete coloring , discrete mathematics , graph coloring , bound graph , line graph
The distance coloring number X d ( G ) of a graph G is the minimum number n such that every vertex of G can be assigned a natural number m ≤ n and no two vertices at distance i are both assigned i . It is proved that for any natural number n there exists a graph G with X d ( G ) = n .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom