On graphs with a large chromatic number that contain no small odd cycles
In this paper, we present lower bounds for the number of vertices in a graph with a large chromatic number that does not contain small odd cycles. Bibliographyy 6 titles.
KeywordsLower Bound Chromatic Number Large Chromatic Number
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 3.P. Erdös, “Problems and results in graph theory and combinatorial analysis,” In: Graph Theory and Related Topics, Academic Press, New York (1979), pp. 153–163.Google Scholar
© Springer Science+Business Media, Inc. 2012