The following pages link to Distance-hereditary graphs (Q1084114):
Displayed 50 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- A polyhedral investigation of star colorings (Q284838) (← links)
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- On the hyperbolicity of bipartite graphs and intersection graphs (Q317426) (← links)
- Complexity of determining the maximum infection time in the geodetic convexity (Q324866) (← links)
- Notes on a theorem of Naji (Q329556) (← links)
- Characterization and recognition of some opposition and coalition graph classes (Q344867) (← links)
- A characterization of line graphs that are squares of graphs (Q400504) (← links)
- Set graphs. IV. Further connections with claw-freeness (Q400530) (← links)
- Fat Hoffman graphs with smallest eigenvalue greater than \(-3\) (Q403567) (← links)
- On the hyperbolicity of random graphs (Q405243) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- A note on connected dominating sets of distance-hereditary graphs (Q423975) (← links)
- Proximity and average eccentricity of a graph (Q436337) (← links)
- On factorial properties of chordal bipartite graphs (Q442348) (← links)
- The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs (Q458577) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- Forests and trees among Gallai graphs (Q472964) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- New results on Ptolemaic graphs (Q499349) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs (Q534056) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- Recognizing locally equivalent graphs (Q685658) (← links)
- The induced path transit function and the Pasch axiom (Q726505) (← links)
- Isotropic matroids. I: Multimatroids and neighborhoods (Q727168) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- Eccentricity function in distance-hereditary graphs (Q784475) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) (← links)
- Networks with small stretch number (Q876723) (← links)
- The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
- On the geodetic iteration number of distance-hereditary graphs (Q898096) (← links)
- Completely separable graphs (Q908944) (← 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)
- Compatible decompositions and block realizations of finite metrics (Q942132) (← links)
- Extremal perfect graphs for a bound on the domination number (Q952634) (← links)
- Distance-hereditary graphs and signpost systems (Q960964) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)