DMTCS Proceedings, 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)

Font Size:  Small  Medium  Large

Equivalent Subgraphs of Order 3

Tomoki Nakamigawa


It is proved that any graph of order 14n/3 + O(1) contains a family of n induced subgraphs of order 3 such that they are vertex-disjoint and equivalent to each other.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page

Valid XHTML 1.0 Transitional