Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Strongly_chordal_graph> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- Strongly_chordal_graph abstract "In the mathematical area of graph theory, an undirected graph G is strongly chordal if it is a chordal graph and every cycle of even length (≥ 6) in G has an odd chord, i.e., an edge that connects two vertices that are an odd distance (>1) apart from each other in the cycle.".
- Strongly_chordal_graph wikiPageID "24809733".
- Strongly_chordal_graph wikiPageRevisionID "577623381".
- Strongly_chordal_graph hasPhotoCollection Strongly_chordal_graph.
- Strongly_chordal_graph subject Category:Graph_families.
- Strongly_chordal_graph subject Category:Perfect_graphs.
- Strongly_chordal_graph type Abstraction100002137.
- Strongly_chordal_graph type Family108078020.
- Strongly_chordal_graph type GraphFamilies.
- Strongly_chordal_graph type Group100031264.
- Strongly_chordal_graph type Organization108008335.
- Strongly_chordal_graph type SocialGroup107950920.
- Strongly_chordal_graph type Unit108189659.
- Strongly_chordal_graph type YagoLegalActor.
- Strongly_chordal_graph type YagoLegalActorGeo.
- Strongly_chordal_graph type YagoPermanentlyLocatedEntity.
- Strongly_chordal_graph comment "In the mathematical area of graph theory, an undirected graph G is strongly chordal if it is a chordal graph and every cycle of even length (≥ 6) in G has an odd chord, i.e., an edge that connects two vertices that are an odd distance (>1) apart from each other in the cycle.".
- Strongly_chordal_graph label "Strongly chordal graph".
- Strongly_chordal_graph sameAs m.080gs1q.
- Strongly_chordal_graph sameAs Q7624675.
- Strongly_chordal_graph sameAs Q7624675.
- Strongly_chordal_graph sameAs Strongly_chordal_graph.
- Strongly_chordal_graph wasDerivedFrom Strongly_chordal_graph?oldid=577623381.
- Strongly_chordal_graph isPrimaryTopicOf Strongly_chordal_graph.