Conditions for $\beta$-perfectness

Share/Save/Bookmark

Keijsper, J.C.M. and Tewes, M. (2000) Conditions for $\beta$-perfectness. [Report]

open access
[img]
Preview
PDF
187kB
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).
Item Type:Report
Additional information:Imported from MEMORANDA
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/65724
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page