Graphs in which each C4 spans K4

Research output: Contribution to journalArticle

1 Citation (Scopus)


It is shown that every graph on n≥6 vertices without induced copies of C4 and K4-e contains a homogeneous set of size [√n].

Original languageEnglish
Pages (from-to)263-268
Number of pages6
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - Jun 15 1996

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Graphs in which each C<sub>4</sub> spans K<sub>4</sub>'. Together they form a unique fingerprint.

  • Cite this