Loading...

A Class of Weakly Perfect Graphs

Maimani, H. R ; Sharif University of Technology

266 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s10587-010-0067-6
  3. Abstract:
  4. A graph is called weakly perfect if its chromatic number equals its clique number. In this note a new class of weakly perfect graphs is presented and an explicit formula for the chromatic number of such graphs is given
  5. Keywords:
  6. Chromatic number ; Clique number ; Weakly perfect graph
  7. Source: Czechoslovak Mathematical Journal ; Volume 60, Issue 4 , 2010 , Pages 1037-1041 ; 00114642 (ISSN)
  8. URL: http://link.springer.com/article/10.1007/s10587-010-0067-6