Live briefing
Everything about Distance-hereditary graph
Graph whose induced subgraphs preserve distance
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. Thus, any induced subgraph inherits the distances of the larger graph. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Distance-hereditary graphA 5-minute orientation
- Skim a recent paper: Mutual-visibility in distance-hereditary graphs: a linear-time algorithmInfluential work since 2022
- Pick up a classic book: The mathematics of Paul ErdösThe most-reprinted book on the subject
- Read the landmark paper: Distance-hereditary graphsCited 336 times
- Go sideways: Perfectly orderable graphA closely related topic
- Go sideways: CographA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Distance-hereditary graphs
A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Distance-hereditary graphs are clique-perfect
Domination in distance-hereditary graphs
Powers of distance-hereditary graphs
Finding a minimum path cover of a distance-hereditary graph in polynomial time
The maximum edit distance from hereditary graph properties
🆕 Influential since 2022
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm
Computing a metric basis of a bipartite distance-hereditary graph
The Weisfeiler–Leman Dimension of Distance-Hereditary Graphs
Twin-distance-hereditary digraphs
A note on distance-hereditary graphs whose complement is also distance-hereditary
📚 Books worth reading
The mathematics of Paul ErdösRonald L. Graham, Jaroslav Nešetřil · 1997- 📕An optimal algorithm recognizing distance-hereditary graphs under a sequence of edge deletionsMarc Tedder · 2006
ICACIEM 2017 · 2017
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Perfectly orderable graph In graph theory, a perfectly orderable graph is a graph whose vertices can be ordered in such a way that a greedy coloring algorithm with that ordering…
- Cograph In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation…
- Perfect graph In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every…
- Chordal bipartite graph In the mathematical area of graph theory, a chordal bipartite graph is a bipartite graph B = (X,Y,E) in which every cycle of length at least 6 in B has…
- Clique-width In graph theory, the clique-width of a graph G is a parameter that describes the structural complexity of the graph; it is closely related to treewidth…
- Trivially perfect graph In graph theory, a trivially perfect graph is a graph with the property that in each of its induced subgraphs the size of the maximum independent set equals…
- Split graph In graph theory, a branch of mathematics, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Split…
- Permutation graph In the mathematical field of graph theory, a permutation graph is a graph whose vertices represent the elements of a permutation, and whose edges represent…