Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Distance-hereditary_graph> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Distance-hereditary_graph abstract "In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances in any connected induced subgraph are the same as they are in the original graph. Thus, any induced subgraph inherits the distances of the larger graph.Distance-hereditary graphs were named and first studied by Howorka (1977), although an equivalent class of graphs was already shown to be perfect in 1970 by Olaru and Sachs.It has been known for some time that the distance-hereditary graphs constitute an intersection class of graphs, but no intersection model was known until one was given by Gioan & Paul (2008).".
- Distance-hereditary_graph thumbnail Distance-hereditary_graph.svg?width=300.
- Distance-hereditary_graph wikiPageExternalLink 417.
- Distance-hereditary_graph wikiPageExternalLink gc_80.html.
- Distance-hereditary_graph wikiPageExternalLink index.html.
- Distance-hereditary_graph wikiPageExternalLink 79g3m7hn12wt1v14.
- Distance-hereditary_graph wikiPageID "17315337".
- Distance-hereditary_graph wikiPageRevisionID "600056508".
- Distance-hereditary_graph hasPhotoCollection Distance-hereditary_graph.
- Distance-hereditary_graph subject Category:Graph_families.
- Distance-hereditary_graph subject Category:Intersection_classes_of_graphs.
- Distance-hereditary_graph subject Category:Perfect_graphs.
- Distance-hereditary_graph type Abstraction100002137.
- Distance-hereditary_graph type Class107997703.
- Distance-hereditary_graph type Collection107951464.
- Distance-hereditary_graph type Communication100033020.
- Distance-hereditary_graph type Graph107000195.
- Distance-hereditary_graph type Group100031264.
- Distance-hereditary_graph type IntersectionClassesOfGraphs.
- Distance-hereditary_graph type PerfectGraphs.
- Distance-hereditary_graph type VisualCommunication106873252.
- Distance-hereditary_graph comment "In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances in any connected induced subgraph are the same as they are in the original graph.".
- Distance-hereditary_graph label "Distance-hereditary graph".
- Distance-hereditary_graph sameAs m.043ps73.
- Distance-hereditary_graph sameAs Q5282847.
- Distance-hereditary_graph sameAs Q5282847.
- Distance-hereditary_graph sameAs Distance-hereditary_graph.
- Distance-hereditary_graph wasDerivedFrom Distance-hereditary_graph?oldid=600056508.
- Distance-hereditary_graph depiction Distance-hereditary_graph.svg.
- Distance-hereditary_graph isPrimaryTopicOf Distance-hereditary_graph.
