Name
Abstract | ||
|---|---|---|
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n -vertex graph. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(99)00322-2 | Discrete Mathematics |
Keywords | Field | DocType |
extremal problem,graph covering,05c35,perfection thickness,05c60,extremal problem: ams 05c60,05c70,perfect graph | Perfect graph,Discrete mathematics,Comparability graph,Combinatorics,Line graph,Distance-hereditary graph,Cograph,Trivially perfect graph,Perfect graph theorem,Mathematics,Split graph | Journal |
Volume | Issue | ISSN |
215 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hirotsugu Asari | 1 | 0 | 0.34 |
| Tao Jiang | 2 | 38 | 4.62 |
| André Kündgen | 3 | 164 | 21.95 |
| Douglas B. West | 4 | 1176 | 185.69 |