Pages that link to "Item:Q1251239"

The following pages link to Optimum domination in weighted trees (Q1251239):

Displaying 18 items.

• The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
• Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
• Dominating sets for split and bipartite graphs (Q794174) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• The weighted perfect domination problem (Q912630) (← links)
• A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
• Independent domination in chordal graphs (Q1169487) (← links)
• The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
• On independent \([1, 2]\)-sets in trees (Q1649903) (← links)
• A linear algorithm for the domination number of a series-parallel graph (Q1837213) (← links)
• On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
• The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
• Best location of service centers in a treelike network under budget constraints (Q2639769) (← links)
• Two algorithms for determining a minimum independent dominating set (Q3319782) (← links)
• On the Algorithmic Complexity of Total Domination (Q3696538) (← links)
• The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054) (← links)
• Dominating cliques in graphs (Q5896554) (← links)
• Dominating cliques in graphs (Q5925264) (← links)