Pages that link to "Item:Q5903263"
From MaRDI portal
The following pages link to Total domination in interval graphs (Q5903263):
Displaying 19 items.
- Finding outer-connected dominating sets in interval graphs (Q495667) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- On the domatic number of interval graphs (Q1111388) (← links)
- A unified approach to domination problems on interval graphs (Q1111566) (← links)
- Total domination in interval graphs revisited (Q1114413) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- On the computational complexity of upper total domination (Q1421481) (← links)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- Achromatic number is NP-complete for cographs and interval graphs (Q1825646) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- Total Roman domination for proper interval graphs (Q4958006) (← links)
- Counting dominating sets in generalized series-parallel graphs (Q5207508) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)
- Convexity of minimal total dominating functions in graphs (Q6085723) (← links)
