The following pages link to Distance-hereditary graphs (Q1084114):
Displayed 50 items.
- 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)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- False-twin-free graphs with a fixed number of negative eigenvalues (Q2020651) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- A note on the triameter of graphs (Q2065800) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries (Q2143136) (← links)
- Extremal cubic graphs for fault-tolerant locating domination (Q2143147) (← links)
- Injective hulls of various graph classes (Q2155861) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- Exact-2-relation graphs (Q2197422) (← links)
- Dualizing distance-hereditary graphs (Q2214323) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Modular decomposition of graphs and the distance preserving property (Q2312661) (← links)
- Generalizations of the matching polynomial to the multivariate independence polynomial (Q2328133) (← links)
- On the spectrum and number of convex sets in graphs (Q2339431) (← links)
- On the Galois lattice of bipartite distance hereditary graphs (Q2352777) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- New graph classes characterized by weak vertex separators and two-pairs (Q2409764) (← links)
- A linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- Graphs of small rank-width are pivot-minors of graphs of small tree-width (Q2442212) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Which distance-hereditary graphs are cover-incomparability graphs? (Q2446853) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← 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)
- Rank-width and vertex-minors (Q2565688) (← links)
- Self-spanner graphs (Q2565853) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Rebuilding convex sets in graphs (Q2566140) (← links)
- Requiring chords in cycles (Q2566156) (← links)
- Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
- Decycling with a matching (Q2628271) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)