See Meyniel graph in All languages combined, or Wiktionary
{ "etymology_text": "Named after Henri Meyniel.", "forms": [ { "form": "Meyniel graphs", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Meyniel graph (plural Meyniel graphs)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "English entries with language name categories using raw markup", "parents": [ "Entries with language name categories using raw markup", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "English terms with non-redundant non-automated sortkeys", "parents": [ "Terms with non-redundant non-automated sortkeys", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Graph theory", "orig": "en:Graph theory", "parents": [ "Mathematics", "Visualization", "Formal sciences", "Computing", "Interdisciplinary fields", "Sciences", "Technology", "All topics", "Fundamental" ], "source": "w" } ], "glosses": [ "A graph in which every odd cycle of length five or more has at least two chords." ], "id": "en-Meyniel_graph-en-noun-kQApeqNW", "links": [ [ "graph theory", "graph theory" ], [ "graph", "graph" ], [ "odd", "odd" ], [ "cycle", "cycle" ], [ "length", "length" ], [ "chord", "chord" ] ], "raw_glosses": [ "(graph theory) A graph in which every odd cycle of length five or more has at least two chords." ], "related": [ { "word": "Meyniel's conjecture" } ], "topics": [ "graph-theory", "mathematics", "sciences" ] } ], "word": "Meyniel graph" }
{ "etymology_text": "Named after Henri Meyniel.", "forms": [ { "form": "Meyniel graphs", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Meyniel graph (plural Meyniel graphs)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "related": [ { "word": "Meyniel's conjecture" } ], "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English entries with language name categories using raw markup", "English eponyms", "English lemmas", "English multiword terms", "English nouns", "English terms with non-redundant non-automated sortkeys", "Pages with 1 entry", "Pages with entries", "en:Graph theory" ], "glosses": [ "A graph in which every odd cycle of length five or more has at least two chords." ], "links": [ [ "graph theory", "graph theory" ], [ "graph", "graph" ], [ "odd", "odd" ], [ "cycle", "cycle" ], [ "length", "length" ], [ "chord", "chord" ] ], "raw_glosses": [ "(graph theory) A graph in which every odd cycle of length five or more has at least two chords." ], "topics": [ "graph-theory", "mathematics", "sciences" ] } ], "word": "Meyniel graph" }
Download raw JSONL data for Meyniel graph meaning in English (1.1kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.