Pages that link to "Item:Q5285479"
From MaRDI portal
The following pages link to Doubly chordal graphs, steiner trees, and connected domination (Q5285479):
Displayed 20 items.
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Intersection graphs of maximal hypercubes (Q1867285) (← links)
- Incidence graphs of biacyclic hypergraphs (Q1923616) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← 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)
- Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph (Q2576353) (← links)
- Signed clique-transversal functions in graphs (Q3056375) (← links)
- Connected Domination (Q3384607) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- Dually chordal graphs (Q6143980) (← links)
- Cosecure domination: hardness results and algorithms (Q6182909) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)