Graphs with no induced C4 and 2K2

Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza

Research output: Contribution to journalArticle

39 Citations (Scopus)


We characterize the structure of graphs containing neither the 4-cycle nor its complement as an induced subgraph. This self-complementary class G of graphs includes split graphs, which are graphs whose vertex set is the union of a clique and an independent set. In the members of G, the number of cliques (as well as the number of maximal independent sets) cannot exceed the number of vertices. Moreover, these graphs are almost extremal to the theorem of Nordhaus and Gaddum (1956).

Original languageEnglish
Pages (from-to)51-55
Number of pages5
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - May 15 1993


ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this