Pages that link to "Item:Q987497"

The following pages link to Labelling algorithms for paired-domination problems in block and interval graphs (Q987497):

Displaying 12 items.

• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
• Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
• Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
• A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
• Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
• Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
• Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
• On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
• Paired-domination in claw-free graphs with minimum degree at least three (Q1730243) (← links)
• Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
• An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
• \(k\)-power domination in block graphs (Q5963656) (← links)