Equivalent Subgraphs of Order $3$ - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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.
Fichier principal
Vignette du fichier
dmAE0157.pdf (128.36 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

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

Identifiers

Cite

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

INSMI TDS-MACS
23 View
410 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More