cograph
a type of graph, formed recursively by complementation and disjoint union operations
Facts
3 properties- Instance of
- hereditary graph class, self-complementary graph class[2]
- Subclass of
- distance-hereditary graph, permutation graph, P5-free graph, AT-free graph[3][4][5][6]
- Studied by
- graph theory[7]
🏷️ Also known as
en cograph
en complement-reducible graph
en P4-free graph
de Co-Graph
fr cographe
he קוגרף
hu kográf
hu komplementer-redukálható gráf
ja コグラフ
pl Kograf
ru дополнительно сводимый граф
ru кограф
uk D*-граф
uk граф, вільний від P4
uk граф з двома нащадками
uk додатково звідний граф
uk спадковий граф Дейсі
zh 補可約圖
zh-hant 餘圖
🔖 Identifiers · 6
- OpenAlex ID
- C59824394
- Freebase ID
- /m/04dlnr
- MathWorld ID
- Cograph
- Microsoft Academic ID (discontinued)
- 59824394
- Stack Exchange tag
- cstheory.stackexchange.com
🔗 Connections
Subtypes 3
Subclass of 2
Maintained by WikiProject 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
cograph is a hereditary graph class[1].