Meyniel graph
graph in which every odd cycle of length five or more has at least two chords
Press Enter · cited answer in seconds
0 sources
Meyniel graph
Summary
Key Facts
- Meyniel graph's subclass of is recorded as strongly perfect graph[1].
- Meyniel graph's subclass of is recorded as anti-hole-free graph[2].
- Meyniel graph's subclass of is recorded as house-free graph[3].
- Meyniel graph's Google Knowledge Graph ID is recorded as /g/11cs25694t[4].
- Meyniel graph's MathWorld ID is recorded as MeynielGraph[5].
- Meyniel graph's Wolfram Language entity code is recorded as Entity["GraphClass", "Meyniel"][6].
- Meyniel graph's graphclasses.org ID is recorded as gc_194[7].
- Meyniel graph's graphclasses.org ID is recorded as gc_265[8].
- Meyniel graph's graphclasses.org ID is recorded as gc_264[9].
- Meyniel graph's graphclasses.org ID is recorded as gc_874[10].