Title of article
Perfection thickness of graphs
Author/Authors
Hirotsugu Asari، نويسنده , , Tao Jiang، نويسنده , , André Kündgen، نويسنده , , Douglas B. West، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
2
From page
263
To page
264
Abstract
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
Keywords
Perfect graph , Graph covering , Extremal problem
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950383
Link To Document