Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5282847> ?p ?o }
Showing triples 1 to 51 of
51
with 100 triples per page.
- Q5282847 subject Q7007192.
- Q5282847 subject Q7217193.
- Q5282847 subject Q8551818.
- Q5282847 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 (2012).".
- Q5282847 thumbnail Distance-hereditary_graph.svg?width=300.
- Q5282847 wikiPageExternalLink index.html.
- Q5282847 wikiPageExternalLink 79g3m7hn12wt1v14.
- Q5282847 wikiPageExternalLink 417.
- Q5282847 wikiPageExternalLink gc_80.html.
- Q5282847 wikiPageWikiLink Q1058754.
- Q5282847 wikiPageWikiLink Q1101814.
- Q5282847 wikiPageWikiLink Q1137554.
- Q5282847 wikiPageWikiLink Q1187620.
- Q5282847 wikiPageWikiLink Q121416.
- Q5282847 wikiPageWikiLink Q126017.
- Q5282847 wikiPageWikiLink Q129239.
- Q5282847 wikiPageWikiLink Q131476.
- Q5282847 wikiPageWikiLink Q1322892.
- Q5282847 wikiPageWikiLink Q1354987.
- Q5282847 wikiPageWikiLink Q17148818.
- Q5282847 wikiPageWikiLink Q174733.
- Q5282847 wikiPageWikiLink Q230655.
- Q5282847 wikiPageWikiLink Q2466732.
- Q5282847 wikiPageWikiLink Q272735.
- Q5282847 wikiPageWikiLink Q273037.
- Q5282847 wikiPageWikiLink Q3186905.
- Q5282847 wikiPageWikiLink Q3498041.
- Q5282847 wikiPageWikiLink Q380679.
- Q5282847 wikiPageWikiLink Q4927193.
- Q5282847 wikiPageWikiLink Q504843.
- Q5282847 wikiPageWikiLink Q5067368.
- Q5282847 wikiPageWikiLink Q5121450.
- Q5282847 wikiPageWikiLink Q5141281.
- Q5282847 wikiPageWikiLink Q5161409.
- Q5282847 wikiPageWikiLink Q5282038.
- Q5282847 wikiPageWikiLink Q5808319.
- Q5282847 wikiPageWikiLink Q6053791.
- Q5282847 wikiPageWikiLink Q7007192.
- Q5282847 wikiPageWikiLink Q7217193.
- Q5282847 wikiPageWikiLink Q727035.
- Q5282847 wikiPageWikiLink Q7390263.
- Q5282847 wikiPageWikiLink Q7782354.
- Q5282847 wikiPageWikiLink Q7840044.
- Q5282847 wikiPageWikiLink Q7844666.
- Q5282847 wikiPageWikiLink Q831672.
- Q5282847 wikiPageWikiLink Q8551818.
- Q5282847 wikiPageWikiLink Q913598.
- Q5282847 wikiPageWikiLink Q924044.
- Q5282847 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.".
- Q5282847 label "Distance-hereditary graph".
- Q5282847 depiction Distance-hereditary_graph.svg.