The following pages link to Maria Patricia Dobson (Q845911):
Displayed 17 items.
- (Q324743) (redirect page) (← links)
- NP-completeness of the \(\{k \}\)-packing function problem in graphs (Q324745) (← links)
- On transitive orientations with restricted covering graphs (Q845912) (← links)
- A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games (Q1941537) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- Tuple domination on graphs with the consecutive-zeros property (Q2132374) (← links)
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners (Q2344754) (← links)
- Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (Q2835672) (← links)
- Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs (Q2840710) (← links)
- The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems (Q2883612) (← links)
- The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs (Q2883613) (← links)
- On the complexity of the {<i>k</i>}-packing function problem (Q2968508) (← links)
- (Q3429490) (← links)
- (Q4810368) (← links)
- (Q5708495) (← links)
- Tuple domination on graphs with the consecutive-zeros property (Q6311531) (← links)
- Efficient algorithms for tuple domination on co-biconvex graphs and web graphs (Q6346959) (← links)