Pages that link to "Item:Q1382270"
From MaRDI portal
The following pages link to Weighted domination of cocomparability graphs (Q1382270):
Displaying 15 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- The weighted independent domination problem is NP-complete for chordal graphs (Q1887072) (← 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)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
