论文信息 - Subgraphs with triangular components

Subgraphs with triangular components

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.

Paul A. Catlin | P. A. Catlin

[1] Paul A. Catlin,et al. Subgraphs of graphs, I , 1974, Discret. Math..

[2] Andras Hajnal,et al. On the maximal number of independent circuits in a graph , 1963 .

[3] Joel H. Spencer,et al. Edge disjoint placement of graphs , 1978, J. Comb. Theory B.

[4] Paul A. Catlin,et al. Embedding subgraphs and coloring graphs under extremal degree conditions , 1976 .

[5] Paul A. Catlin. Graph Decompositions Satisfying Extremal Degree Constraints , 1978, J. Graph Theory.