See Heawood graph in All languages combined, or Wiktionary
{ "etymology_text": "Named after Percy John Heawood.", "forms": [ { "form": "Heawood graphs", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Heawood graph (plural Heawood 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": "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": [ "An undirected graph with 14 vertices and 21 edges." ], "id": "en-Heawood_graph-en-noun-yUV42NN9", "links": [ [ "graph theory", "graph theory" ], [ "undirected graph", "undirected graph" ], [ "vertices", "vertex" ], [ "edge", "edge" ] ], "raw_glosses": [ "(graph theory) An undirected graph with 14 vertices and 21 edges." ], "topics": [ "graph-theory", "mathematics", "sciences" ] } ], "word": "Heawood graph" }
{ "etymology_text": "Named after Percy John Heawood.", "forms": [ { "form": "Heawood graphs", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Heawood graph (plural Heawood graphs)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English eponyms", "English lemmas", "English multiword terms", "English nouns", "Pages with 1 entry", "Pages with entries", "en:Graph theory" ], "glosses": [ "An undirected graph with 14 vertices and 21 edges." ], "links": [ [ "graph theory", "graph theory" ], [ "undirected graph", "undirected graph" ], [ "vertices", "vertex" ], [ "edge", "edge" ] ], "raw_glosses": [ "(graph theory) An undirected graph with 14 vertices and 21 edges." ], "topics": [ "graph-theory", "mathematics", "sciences" ] } ], "word": "Heawood graph" }
Download raw JSONL data for Heawood graph meaning in English (0.9kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-01-25 from the enwiktionary dump dated 2025-01-20 using wiktextract (c15a5ce and 5c11237). 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.