Loading...

Kr-free uniquely vertex colorable graphs with minimum possible edges

Akbari, S ; Sharif University of Technology | 2001

1 Viewed
  1. Type of Document: Article
  2. DOI: 10.1006/jctb.2000.2028
  3. Publisher: 2001
  4. Abstract:
  5. We construct counterexamples to the conjecture of Xu (1990, J. Combin. Theory Ser. B50, 319-320) that every uniquely r-colorable graph of order n with exactly (r-1)n-(r2) edges must contain a Kr. © 2001 Academic Press
  6. Keywords:
  8. Source: Journal of Combinatorial Theory. Series B ; Volume 82, Issue 2 , 2001 , Pages 316-318 ; 00958956 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0095895600920288