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):

Displaying 20 items.

• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
• Labelling algorithms for paired-domination problems in block and interval graphs (Q987497) (← links)
• A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
• Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
• Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
• A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
• Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
• Linear algorithms for red and blue domination in convex bipartite graphs (Q2115838) (← links)
• Paired domination versus domination and packing number in graphs (Q2165257) (← links)
• Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
• A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← 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)
• A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph (Q2446306) (← links)
• An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
• An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
• Upper paired domination versus upper domination (Q5024681) (← links)
• The Outer-Paired Domination of Graphs (Q6114861) (← links)
• Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)