Equivalent Subgraphs of Order $3$
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.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
| Schriftenreihe: | Discrete Mathematics & Theoretical Computer Science |
| Schlagworte: | |
| Online-Zugang: | https://dmtcs.episciences.org/3460/pdf |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|