Name
Abstract | ||
|---|---|---|
The vertex set of the reduced Kneser graphKG2(m,2) consists of all pairs {a,b} suchthat a, bε{1,2,…,m} and2≤|a-b|≤m-2. Two vertices are defined tobe adjacent if they are disjoint. We prove that, if m≥4and m≠5, then the circular chromatic number ofKG2(m,2) is equal to m-2, its ordinarychromatic number. © 2002 Wiley Periodicals, Inc. J GraphTheory 41: 6268, 2002 |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1002/jgt.v41:1 | Journal of Graph Theory |
Keywords | Field | DocType |
kneser graph | Wheel graph,Discrete mathematics,Topology,Combinatorics,Graph power,Cycle graph,Foster graph,Friendship graph,Kneser graph,Petersen graph,Windmill graph,Mathematics | Journal |
Volume | Issue | ISSN |
41 | 1 | 0364-9024 |
Citations | PageRank | References |
10 | 1.35 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ko-wei Lih | 1 | 529 | 58.80 |
| Daphne Der-Fen Liu | 2 | 232 | 26.32 |