Abstract
A number of famous results about triangle-free graphs determine the maximum chromatic number of graphs of order n with minimum degree greater than n/3. In this note these results are extended to Kr-free graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.