Name
Abstract | ||
|---|---|---|
Corradi and Hajnal [5] showed that if the minimum degree @d(G) of a graph on p vertices satisfies the inequality @d(G) = 13(2@r - 1), then G has a subgraph consisting of [13@r] triangular components. They gave a class of graphs which shows that their inequality is best possible. In this paper, we characterize the extremal graphs G, and we thereby show that there are two classes of graphs G for which the inequality is best possible. |
Year | DOI | Venue |
|---|---|---|
1979 | 10.1016/0012-365X(79)90106-7 | Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Mathematics | Journal | 27 |
Issue | ISSN | Citations |
2 | Discrete Mathematics | 0 |
PageRank | References | Authors |
0.34 | 3 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul A. Catlin | 1 | 514 | 66.29 |