Loading...
- Type of Document: Article
- DOI: 10.1007/s10587-010-0067-6
- Abstract:
- 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
- Keywords:
- Chromatic number ; Clique number ; Weakly perfect graph
- Source: Czechoslovak Mathematical Journal ; Volume 60, Issue 4 , 2010 , Pages 1037-1041 ; 00114642 (ISSN)
- URL: http://link.springer.com/article/10.1007/s10587-010-0067-6