The following pages link to (Q3481747):
Displaying 22 items.
- Finding outer-connected dominating sets in interval graphs (Q495667) (← links)
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- Minimal proper interval completions (Q963366) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
- Double-threshold permutation graphs (Q2159387) (← links)
- Exact square coloring of certain classes of graphs: complexity and algorithms (Q2172606) (← links)
- Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Perfect Roman domination in graphs (Q2333784) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259) (← links)
- Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
- Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)
- Acyclic Matching in Some Subclasses of Graphs (Q5041209) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
- The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Algorithms and hardness results for edge total domination problem in graphs (Q6199394) (← links)
