The following pages link to Distance-hereditary graphs (Q1084114):
Displayed 50 items.
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- Distance-hereditary digraphs (Q972365) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Cover-incomparability graphs of posets (Q1013992) (← links)
- On an extension of distance hereditary graphs (Q1025561) (← links)
- A graph-theoretical invariant of topological spaces (Q1027486) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers (Q1043551) (← links)
- Pseudo-modular graphs (Q1084416) (← links)
- On the null-homotopy of bridged graphs (Q1099187) (← links)
- Isotropic systems (Q1101116) (← links)
- Hereditary modular graphs (Q1112068) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- A note on distance matrices with unicyclic graph realizations (Q1121283) (← links)
- A Helly theorem in weakly modular space (Q1126279) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Metric characterization of parity graphs (Q1182856) (← links)
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication (Q1182965) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Trees, taxonomy, and strongly compatible multi-state characters (Q1364321) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- Subgraph trees in graph theory (Q1406544) (← links)
- MAD trees and distance-hereditary graphs (Q1408821) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- Reconstruction of distance hereditary 2-connected graphs (Q1637150) (← 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)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
- Twin subgraphs and core-semiperiphery-periphery structures (Q1722674) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- On the partial order competition dimensions of chordal graphs (Q1786874) (← links)
- (\(k,+\))-distance-hereditary graphs (Q1827274) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Block duplicate graphs and a hierarchy of chordal graphs (Q1850116) (← links)
- Hyperbolic bridged graphs (Q1864582) (← links)
- Powers of distance-hereditary graphs (Q1901030) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Quasi-threshold graphs (Q1923584) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)