strangulated graph
graph whose peripheral cycles are all triangles
Press Enter · cited answer in seconds
0 sources
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].