Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Strangulated_graph> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Strangulated_graph abstract "In graph theoretic mathematics, a strangulated graph is a graph in which deleting any induced cycle of length greater than three would disconnect the remaining graph. That is, they are the graphs in which every peripheral cycle is a triangle.".
- Strangulated_graph thumbnail Strangulated_graph.svg?width=300.
- Strangulated_graph wikiPageID "36971277".
- Strangulated_graph wikiPageRevisionID "567170659".
- Strangulated_graph hasPhotoCollection Strangulated_graph.
- Strangulated_graph subject Category:Graph_families.
- Strangulated_graph subject Category:Planar_graphs.
- Strangulated_graph comment "In graph theoretic mathematics, a strangulated graph is a graph in which deleting any induced cycle of length greater than three would disconnect the remaining graph. That is, they are the graphs in which every peripheral cycle is a triangle.".
- Strangulated_graph label "Strangulated graph".
- Strangulated_graph sameAs m.0l_sjzx.
- Strangulated_graph sameAs Q7621644.
- Strangulated_graph sameAs Q7621644.
- Strangulated_graph wasDerivedFrom Strangulated_graph?oldid=567170659.
- Strangulated_graph depiction Strangulated_graph.svg.
- Strangulated_graph isPrimaryTopicOf Strangulated_graph.
