Pages that link to "Item:Q1051004"
From MaRDI portal
The following pages link to Characterizations of strongly chordal graphs (Q1051004):
Displaying 50 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
- On basic chordal graphs and some of its subclasses (Q299101) (← links)
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Graph modification problem for some classes of graphs (Q350726) (← links)
- A note on sparseness conditions on chordless vertices of cycles (Q385389) (← links)
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- Crown-free lattices and their related graphs (Q651416) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Special eccentric vertices for the class of chordal graphs and related classes (Q742574) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- Totally balanced dissimilarities (Q779024) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Graphs whose neighborhoods have no special cycles (Q798333) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- One-sided discrete terrain guarding and chordal graphs (Q831703) (← links)
- On the terminal connection problem (Q831820) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- Domination in convex and chordal bipartite graphs (Q918703) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- On probe permutation graphs (Q967305) (← links)
- Signed and minus clique-transversal functions on graphs (Q976135) (← links)
- Exact leaf powers (Q982668) (← links)
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- From a simple elimination ordering to a strong elimination ordering in linear time (Q1007631) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
