Pages that link to "Item:Q788002"

The following pages link to Domination, independent domination, and duality in strongly chordal graphs (Q788002):

Displaying 18 items.

• An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
• Roman domination on strongly chordal graphs (Q385486) (← links)
• Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
• Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
• On the max min vertex cover problem (Q499339) (← links)
• On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
• The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
• Which claw-free graphs are perfectly orderable? (Q686245) (← links)
• A linear algorithm for the group path problem on chordal graphs (Q686257) (← links)
• Independent domination in directed graphs (Q4957541) (← links)
• A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
• Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
• Common extremal graphs for three inequalities involving domination parameters (Q5134523) (← links)
• A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
• Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
• A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
• Mobility offer allocations in corporate settings (Q6114908) (← links)
• Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)