strangulated graph

graph whose peripheral cycles are all triangles
Thing general Q7621644
Press Enter · cited answer in seconds

strangulated graph

Summary

Key Facts

  • strangulated graph is credited with the discovery of Neil Robertson[1].
  • strangulated graph is a type of finite graph[2].
  • strangulated graph's described by source is recorded as A generalization of chordal graphs[3].
  • strangulated graph's maintained by WikiProject is recorded as WikiProject Mathematics[4].

Body

Definition and Type

strangulated graph is a type of finite graph[2].

📑 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). strangulated graph. Retrieved May 7, 2026, from https://4ort.xyz/entity/strangulated-graph
MLA “strangulated graph.” 4ort.xyz Knowledge Graph, 4ort.xyz, 7 May. 2026, https://4ort.xyz/entity/strangulated-graph.
BibTeX @misc{4ortxyz_strangulated-graph_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{strangulated graph}}, year = {2026}, url = {https://4ort.xyz/entity/strangulated-graph}, note = {Accessed: 2026-05-07}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): strangulated graph — https://4ort.xyz/entity/strangulated-graph (retrieved 2026-05-07)

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