distance-hereditary graph
graph whose induced subgraphs preserve distance
Facts
2 properties- Instance of
- hereditary graph class
- Subclass of
- parity graph, perfectly orderable graph[2][3]
🏷️ Also known as
en completely separable graph
en distance-hereditary graph
de distanzerhaltender Graph
fr graphe à distance héréditaire
he גרף תורשתי למרחק
he גרף מרחק-תורשתי
he גרף ניתן להפרדה לחלוטין
he גרף נפרד לחלוטין
hu távolság-örökletes gráf
hu távolságtartó gráf
hu teljesen szeparábilis gráf
ru вполне сепарабельный граф
ru дистанционно-наследуемый граф
uk дистанційно-успадковуваний граф
uk цілком сепарабельний граф
zh 距离-遗传图
🔖 Identifiers · 6
- OpenAlex ID
- C147792647
- Freebase ID
- /m/043ps73
- MathWorld ID
- Distance-HereditaryGraph
- Microsoft Academic ID (discontinued)
- 147792647
- Wolfram Language entity code
- Entity["GraphClass", "DistanceHereditary"]
🔗 Connections
Subtypes 3
Press Enter · cited answer in seconds
0 sources
Summary
distance-hereditary graph is a hereditary graph class[1].