Equivalent Subgraphs of Order $3$ - Archive ouverte HAL
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

Equivalent Subgraphs of Order $3$

Résumé

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.
Fichier principal
Vignette du fichier
dmAE0157.pdf (128.36 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184449 , version 1 (14-08-2015)

Identifiants

Citer

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

Collections

TDS-MACS
35 Consultations
617 Téléchargements

Altmetric

Partager

More