Matches in DBpedia 2014 for { <http://dbpedia.org/resource/K-Variegated_graph> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- K-Variegated_graph abstract "In graph theory, a bivariegated graph is a graph whose vertex set can be partitioned into two equal parts such that each vertex is adjacent to exactly one vertex from the other set not containing it.In a bivarigated graph G with 2n vertices, there exists a set of n independent edges such that no odd number of them lie on a cycle of G.".
- K-Variegated_graph thumbnail Petersen1_tiny.svg?width=300.
- K-Variegated_graph wikiPageID "16647875".
- K-Variegated_graph wikiPageRevisionID "493270722".
- K-Variegated_graph hasPhotoCollection K-Variegated_graph.
- K-Variegated_graph subject Category:Graph_families.
- K-Variegated_graph type Abstraction100002137.
- K-Variegated_graph type Family108078020.
- K-Variegated_graph type GraphFamilies.
- K-Variegated_graph type Group100031264.
- K-Variegated_graph type Organization108008335.
- K-Variegated_graph type SocialGroup107950920.
- K-Variegated_graph type Unit108189659.
- K-Variegated_graph type YagoLegalActor.
- K-Variegated_graph type YagoLegalActorGeo.
- K-Variegated_graph type YagoPermanentlyLocatedEntity.
- K-Variegated_graph comment "In graph theory, a bivariegated graph is a graph whose vertex set can be partitioned into two equal parts such that each vertex is adjacent to exactly one vertex from the other set not containing it.In a bivarigated graph G with 2n vertices, there exists a set of n independent edges such that no odd number of them lie on a cycle of G.".
- K-Variegated_graph label "K-Variegated graph".
- K-Variegated_graph sameAs m.03yjjdd.
- K-Variegated_graph sameAs Q6322787.
- K-Variegated_graph sameAs Q6322787.
- K-Variegated_graph sameAs K-Variegated_graph.
- K-Variegated_graph wasDerivedFrom K-Variegated_graph?oldid=493270722.
- K-Variegated_graph depiction Petersen1_tiny.svg.
- K-Variegated_graph isPrimaryTopicOf K-Variegated_graph.