Name
Abstract | ||
|---|---|---|
We investigate the local chromatic number of shift graphs and prove that it is close to their chromatic number. This implies that the gap between the directed local chromatic number of an oriented graph and the local chromatic number of the underlying undirected graph can be arbitrarily large. We also investigate the minimum possible directed local chromatic number of oriented versions of “topologically t-chromatic” graphs. We show that this minimum for large enough t-chromatic Schrijver graphs and t-chromatic generalized Mycielski graphs of appropriate parameters is ⌈t/4⌉+1. © 2010 Wiley Periodicals, Inc. J Graph Theory 66: 65-82, 2010 © 2011 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1002/jgt.20494 | Journal of Graph Theory |
Keywords | Field | DocType |
shift graph,topologically t-chromatic,t-chromatic generalized mycielski graph,chromatic number,oriented version,wiley periodicals,borsuk-like graph,inc. j graph theory,oriented graph,large enough t-chromatic schrijver,local chromatic number | Topology,Discrete mathematics,Indifference graph,Combinatorics,Chordal graph,Foster graph,Pathwidth,1-planar graph,Windmill graph,Mathematics,Triangle-free graph,Critical graph | Journal |
Volume | Issue | ISSN |
66 | 1 | 0364-9024 |
Citations | PageRank | References |
5 | 0.77 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Simonyi | 1 | 249 | 29.78 |
| Gábor Tardos | 2 | 1261 | 140.58 |