On graphs with a large chromatic number that contain no small odd cycles
- 39 Downloads
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.
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