On directed local chromatic number, shift graphs, and Borsuk-like graphs

Details On directed local chromatic number, shift graphs, and Borsuk-like graphs On directed local chromatic number, shift graphs, and Borsuk-like graphs

2009-06-16

arxiv.org/abs/0906.2897v1

Mathematics

Combinatorics

18 pages

Scientific paper

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 the upper integer part of t/4+1.

Affiliated with

Also associated with

No associations

Rating

On directed local chromatic number, shift graphs, and Borsuk-like graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On directed local chromatic number, shift graphs, and Borsuk-like graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On directed local chromatic number, shift graphs, and Borsuk-like graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-475595