On graphs with a large chromatic number containing no small odd cycles

Details On graphs with a large chromatic number containing no small odd cycles On graphs with a large chromatic number containing no small odd cycles

2012-01-16

arxiv.org/abs/1201.3271v1

Mathematics

Combinatorics

Scientific paper

In this paper, we present the lower bounds for the number of vertices in a
graph with a large chromatic number containing no small odd cycles.

Affiliated with

Also associated with

No associations

Rating

On graphs with a large chromatic number containing no small odd cycles 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 graphs with a large chromatic number containing no small odd cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On graphs with a large chromatic number containing no small odd cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410285