@book{1365452d428c42b4a36864efdc5a542a,

title = "Conditions for $\beta$-perfectness",

abstract = "A $\beta$-perfect graph is a simple graph $G$ such that $\chi(G')=\beta(G')$ for every induced subgraph $G'$ of $G$, where $\chi(G')$ is the chromatic number of $G'$, and $\beta(G')$ is defined as the maximum over all induced subgraphs $H$ of $G'$ of the minimum vertex degree in $H$. The vertices of a $\beta$-perfect graph $G$ can be coloured with $\chi(G)$ colours in polynomial time (greedily).",

keywords = "EWI-3357, MSC-05C75, MSC-05C15, IR-65724",

author = "J.C.M. Keijsper and M. Tewes",

note = "Imported from MEMORANDA ",

year = "2000",

language = "Undefined",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1537",

}