Name
Abstract | ||
|---|---|---|
A graph is said to be a cover graph if it is the underlying graph of the Hasse diagram of a finite partially ordered set. We prove that the generalized Mycielski graphs M\"m(C\"2\"t\"+\"1) of an odd cycle, Kneser graphs KG(n,k), and Schrijver graphs SG(n,k) are not cover graphs when m=0,t=1, k=1, and n=2k+2. These results have consequences in circular chromatic number. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.08.082 | Discrete Mathematics |
Keywords | Field | DocType |
circular chromatic number,kneser graph,schrijver graph,mycielski graph,cover graph,partially ordered set | Discrete mathematics,Odd graph,Indifference graph,Combinatorics,Chordal graph,Kneser graph,1-planar graph,Triangle-free graph,Pancyclic graph,Mathematics,Split graph | Journal |
Volume | Issue | ISSN |
308 | 20 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ko-wei Lih | 1 | 529 | 58.80 |
| Chen-Ying Lin | 2 | 10 | 1.82 |
| Li-da Tong | 3 | 46 | 12.49 |