Name
Abstract | ||
|---|---|---|
The family of all critically strongly-imperfect graphs decomposes in two nonempty classes: perfect and imperfect ones. In this paper we characterize the critically strongly-imperfect graphs which are, simultaneously, imperfect. We prove that these are precisely the holes of odd length ⩾ 5 or their complements. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0012-365X(95)00058-5 | Discrete Mathematics |
Keywords | Field | DocType |
strongly-imperfect graph | Discrete mathematics,Graph,Combinatorics,Imperfect,Mathematics | Journal |
Volume | Issue | ISSN |
156 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elefterie Olaru | 1 | 8 | 3.85 |