Assertion: graph's g | /r/HasProperty | \displaystyle gg ¯
Facets:
Source sentences:
text: By the strong perfect graph theorem, perfect graphs are the same as Berge graphs, which are graphs G {\displaystyle G} G {\displaystyle G} G ¯ {\displaystyle {\bar {G}}} induced cycle of odd length 5 or more.