Pages that link to "Item:Q1117254"

The following pages link to Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254):

Displaying 30 items.

• Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• The k-neighbor domination problem (Q811346) (← links)
• The weighted perfect domination problem (Q912630) (← links)
• Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
• A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
• A survey of selected recent results on total domination in graphs (Q998491) (← links)
• \(k\)-tuple domination in graphs (Q1014390) (← links)
• Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
• A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
• The \(k\)-neighbor, \(r\)-domination problems on interval graphs (Q1342074) (← links)
• \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
• On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
• Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
• Chromatic numbers of competition graphs (Q1805322) (← links)
• The weighted perfect domination problem and its variants (Q1917310) (← links)
• Liar's domination in graphs: complexity and algorithm (Q1949115) (← links)
• Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
• Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
• Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
• Algorithmic Aspects of Disjunctive Total Domination in Graphs (Q2958321) (← links)
• Approximating the Spanning k-Tree Forest Problem (Q5321721) (← links)
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
• Domination in distance-hereditary graphs (Q5957300) (← links)
• An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
• A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)