Cograph
id:
cograph-275-1550847
title:
Cograph
text:
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union. That is, the family of cographs is the smallest class of graphs that includes K1 and is closed under complementation and disjoint union. Cographs have been discovered independently by several authors since the 1970s; early references include Jung (1978), Lerchs (1971), Seinsche (1974), and Sumner (1974). They have als
brand slug:
wiki
category slug:
encyclopedia
description:
Graph formed by complementation and disjoint union
original url:
https://en.wikipedia.org/wiki/Cograph
date created:
date modified:
2024-01-09T02:51:11Z
main entity:
{"identifier":"Q5141281","url":"https://www.wikidata.org/entity/Q5141281"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/1/1b/Turan_13-4.svg","width":470,"height":470}
fields total:
13
integrity:
15