Pages that link to "Item:Q987497"
From MaRDI portal
The following pages link to Labelling algorithms for paired-domination problems in block and interval graphs (Q987497):
Displaying 26 items.
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- Paired-domination in claw-free graphs with minimum degree at least three (Q1730243) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Vertices in all minimum paired-dominating sets of block graphs (Q1928534) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs (Q2082215) (← links)
- Roman \(\{2\}\)-domination problem in graphs (Q2118251) (← links)
- Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph (Q2446306) (← links)
- Upper bounds for the paired-domination numbers of graphs (Q2631089) (← links)
- Paired-domination in claw-free graphs (Q2637727) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- Semipaired Domination in Some Subclasses of Chordal Graphs (Q5038198) (← links)
- Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)