Skip to Main content Skip to Navigation
Conference papers

Equivalent Subgraphs of Order $3$

Abstract : 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.
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184449
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, August 14, 2015 - 2:59:29 PM
Last modification on : Thursday, May 11, 2017 - 1:02:51 AM
Long-term archiving on: : Sunday, November 15, 2015 - 11:14:15 AM

File

dmAE0157.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184449, version 1

Collections

Citation

Tomoki Nakamigawa. Equivalent Subgraphs of Order $3$. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.289-292. ⟨hal-01184449⟩

Share

Metrics

Record views

330

Files downloads

484