Results 191 to 200 of about 994 (225)
Some of the next articles are maybe not open access.

A generalization of perfect graphs?i-perfect graphs

Journal of Graph Theory, 1996
The \(i\)-chromatic number of \(G\), denoted \(\chi_i(G)\), is the least number \(k\) such that there is a \(k\)-colouring with no colour class inducing a \(K_{i+1}\) as a subgraph. The \(i\)-clique number, \(\omega_i(G)\), is defined to be \(\lceil \omega(G)/i\rceil\). An induced subgraph \(H\) of \(G\) is an \(i\)-transversal iff \(\omega(H)= i\) and
Leizhen Cai, Derek G. Corneil
openaire   +2 more sources

Maimonides on Perfecting Perfection

Harvard Theological Review, 2017
This article addresses two critical questions concerning Maimonides's views on human perfection at the end of hisGuide of the Perplexed. The first is: For those who have reached the highest category of perfection—intellectual perfection, apprehension of the divine, the divine science—what prescription does Maimonides offer for perfecting that ...
openaire   +1 more source

Rank-perfect and" weakly rank-perfect graphs

Mathematical Methods of Operations Research (ZOR), 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Make Perfection More Perfect

Cardiovascular Revascularization Medicine, 2019
openaire   +2 more sources

Home - About - Disclaimer - Privacy