Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:characterizedBy |
absence of odd cycles of length at least five and their complements as induced subgraphs
|
| gptkbp:definedIn |
a graph in which every odd cycle of length at least five has a chord
|
| gptkbp:firstDefined |
1960s
|
| https://www.w3.org/2000/01/rdf-schema#label |
Berge graph
|
| gptkbp:importantFor |
graph coloring
Strong Perfect Graph Conjecture clique problems |
| gptkbp:namedAfter |
gptkb:Claude_Berge
|
| gptkbp:property |
contains no odd hole or odd antihole
every induced subgraph is also a Berge graph |
| gptkbp:relatedTo |
gptkb:Strong_Perfect_Graph_Theorem
perfect graph |
| gptkbp:usedIn |
theoretical computer science
combinatorics |
| gptkbp:bfsParent |
gptkb:Claude_Berge
|
| gptkbp:bfsLayer |
7
|