bn:00972208n
Noun Concept
Categories: Perfect graphs, Graph families, Intersection classes of graphs
EN
distance-hereditary graph  completely separable graph
EN
In graph theory, a branch of discrete mathematics, a distance-hereditary graph is a graph in which the distances in any connected induced subgraph are the same as they are in the original graph. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, a branch of discrete mathematics, a distance-hereditary graph is a graph in which the distances in any connected induced subgraph are the same as they are in the original graph. Wikipedia
Graph whose induced subgraphs preserve distance Wikidata
IS A
HAS KIND
Wikipedia Redirections