Page 1 Next

Displaying 1 – 20 of 1806

Showing per page


Paulo Ribenboim (2003)

Bollettino dell'Unione Matematica Italiana

A class of weakly perfect graphs

H. R. Maimani, M. R. Pournaki, S. Yassemi (2010)

Czechoslovak Mathematical Journal

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.

Currently displaying 1 – 20 of 1806

Page 1 Next