Pages that link to "Item:Q386432"

The following pages link to Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432):

Displayed 6 items.

• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) ‎ (← links)
• Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) ‎ (← links)
• Algorithmic aspects of upper paired-domination in graphs (Q2283034) ‎ (← links)
• Large hypertree width for sparse random hypergraphs (Q2343976) ‎ (← links)
• A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) ‎ (← links)
• An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) ‎ (← links)