The following pages link to Completely separable graphs (Q908944):
Displaying 50 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- Comparing the metric and strong dimensions of graphs (Q507581) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) (← links)
- Networks with small stretch number (Q876723) (← links)
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs (Q941349) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- Distance-hereditary digraphs (Q972365) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- PLA folding in special graph classes (Q1329804) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- MAD trees and distance-hereditary graphs (Q1408821) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- (\(k,+\))-distance-hereditary graphs (Q1827274) (← links)
- Powers of distance-hereditary graphs (Q1901030) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem (Q1962066) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Knocking out \(P_k\)-free graphs (Q2352787) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Bipartite almost distance-hereditary graphs (Q2470455) (← links)
- Equistable distance-hereditary graphs (Q2473043) (← links)
- The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Rebuilding convex sets in graphs (Q2566140) (← links)
- Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
- Distance-Hereditary Comparability Graphs (Q2840542) (← links)
- Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
- The bi-join decomposition (Q3439330) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
