Loading...

Weakly perfect graphs arising from rings

Maimani, H. R ; Sharif University of Technology | 2010

101 Viewed
  1. Type of Document: Article
  2. DOI: 10.1017/S0017089510000108
  3. Publisher: 2010
  4. Abstract:
  5. A graph is called weakly perfect if its chromatic number equals its clique number. In this paper a new class of weakly perfect graphs arising from rings are presented and an explicit formula for the chromatic number of such graphs is given. Copyright
  6. Keywords:
  8. Source: Glasgow Mathematical Journal ; Volume 52, Issue 3 , 2010 , Pages 417-425 ; 00170895 (ISSN)
  9. URL: https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/div-classtitleweakly-perfect-graphs-arising-from-ringsdiv/3775BC326033FA89E4384D49682AF5F0