The following pages link to Dually Chordal Graphs (Q4210216):
Displaying 50 items.
- Detour trees (Q277622) (← links)
- On basic chordal graphs and some of its subclasses (Q299101) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- Split clique graph complexity (Q393107) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- The domination game played on unions of graphs (Q468438) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees (Q722442) (← links)
- Special eccentric vertices for the class of chordal graphs and related classes (Q742574) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- Recognizing clique graphs of directed and rooted path graphs (Q1293208) (← links)
- Subgraph trees in graph theory (Q1406544) (← links)
- Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs (Q1675823) (← links)
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- On minimal vertex separators of dually chordal graphs: properties and characterizations (Q1759837) (← links)
- From hypertrees to arboreal quasi-ultrametrics (Q1766738) (← links)
- Dual filtered graphs (Q1800655) (← links)
- The clique operator on cographs and serial graphs (Q1827743) (← links)
- A polynomial algorithm for the strong Helly property (Q1847378) (← links)
- Intersection graphs of maximal hypercubes (Q1867285) (← links)
- Dualizing chordal graphs (Q1869220) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- On partial Grundy coloring of bipartite graphs and chordal graphs (Q2009016) (← links)
- Injective hulls of various graph classes (Q2155861) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs (Q2184677) (← links)
- Computing the hull number in \(\Delta \)-convexity (Q2205950) (← links)
- Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- 3-colouring for dually chordal graphs and generalisations (Q2404614) (← links)
- On the recognition of neighborhood inclusion posets (Q2413186) (← links)
- Restrained domination in some subclasses of chordal graphs (Q2413358) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- On the correspondence between tree representations of chordal and dually chordal graphs (Q2448885) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\) (Q2495511) (← links)
- Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
