Every (p, p-2) graph is contained in its complement

Every (p, p-2) graph is contained in its complement

The following is proved: If G is graph of order p (≥2) and size p‐2, then there exists an isomorphic embedding of G into its complement.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of graph theory 1977-09, Vol.1 (3), p.277-279
Hauptverfasser: Burns, David, Schuster, Seymour
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The following is proved: If G is graph of order p (≥2) and size p‐2, then there exists an isomorphic embedding of G into its complement.
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.3190010308