weakly chordal graph
graph free of holes and anti-holes
Press Enter · cited answer in seconds
0 sources
weakly chordal graph
Summary
weakly chordal graph is a self-complementary graph class[1].
Key Facts
- weakly chordal graph's instance of is recorded as self-complementary graph class[2].
- chordal graph is named after weakly chordal graph[3].
- weakly chordal graph's subclass of is recorded as perfect graph[4].
- weakly chordal graph's subclass of is recorded as hole-free graph[5].
- weakly chordal graph's subclass of is recorded as anti-hole-free graph[6].
- weakly chordal graph's Google Knowledge Graph ID is recorded as /g/120l2j__[7].
- weakly chordal graph's maintained by WikiProject is recorded as WikiProject Mathematics[8].
- weakly chordal graph's graphclasses.org ID is recorded as gc_14[9].
- weakly chordal graph's graphclasses.org ID is recorded as gc_435[10].