Meyniel graph
graph in which every odd cycle of length five or more has at least two chords
Facts
1 property- Subclass of
- strongly perfect graph, anti-hole-free graph, house-free graph[1][2][3]
🏷️ Also known as
en Meyniel graph
en very strongly perfect graph
he גרף מיניאל
he גרף של מיניאל
hu Meyniel-gráf
ru Граф Мейнеля
🔖 Identifiers · 4
- Google Knowledge Graph ID
- /g/11cs25694t
- MathWorld ID
- MeynielGraph
- Wolfram Language entity code
- Entity["GraphClass", "Meyniel"]
Press Enter · cited answer in seconds