Pages that link to "Item:Q386432"
From MaRDI portal
The following pages link to Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432):
Displayed 12 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)
- Linear algorithms for red and blue domination in convex bipartite graphs (Q2115838) (← 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)
- 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)
- Complexity of paired domination in at-free and planar graphs (Q6102264) (← links)