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
Graphclasses.org ID
gc_194, gc_265, gc_264, gc_874
MathWorld ID
MeynielGraph
Wolfram Language entity code
Entity["GraphClass", "Meyniel"]

Report an error or request removal Lineage (PROV-JSON)

Press Enter · cited answer in seconds

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [1] ↑ . Meyniel graphs are strongly perfect. wikidata.org.
  2. [2] ↑ . wikidata.org.
  3. [3] ↑ . wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Meyniel graph. Retrieved November 19, 2026, from https://4ort.xyz/entity/meyniel-graph
MLA “Meyniel graph.” 4ort.xyz Knowledge Graph, 4ort.xyz, 19 Nov. 2026, https://4ort.xyz/entity/meyniel-graph.
BibTeX @misc{4ortxyz_meyniel-graph_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Meyniel graph}}, year = {2026}, url = {https://4ort.xyz/entity/meyniel-graph}, note = {Accessed: 2026-11-19}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Meyniel graph — https://4ort.xyz/entity/meyniel-graph (retrieved 2026-11-19)

Canonical URL: https://4ort.xyz/entity/meyniel-graph · Last refreshed: