Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Strangulated graph
open-in-new
<p>In <a href="/facts/Graph_theory/VVPCd4TX">graph theoretic mathematics</a>, a strangulated graph is a <a href="/facts/Graph_(discrete_mathematics)/kw3eIBUe">graph</a> in which deleting the edges of any <a href="/facts/Induced_cycle/zfcIx9Sw">induced cycle</a> of length greater than three would <a href="/facts/Connected_graph/FSNjsYhz">disconnect</a> the remaining graph. That is, they are the graphs in which every <a href="/facts/Peripheral_cycle/nUueprpV">peripheral cycle</a> is a triangle. </p>