Pages that link to "Item:Q2384392"
From MaRDI portal
The following pages link to Paired domination on interval and circular-arc graphs (Q2384392):
Displayed 16 items.
- Which trees have a differentiating-paired dominating set? (Q543501) (← links)
- Graphs with disjoint dominating and paired-dominating sets (Q607427) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- Well paired-dominated graphs (Q711404) (← links)
- A characterization of graphs with disjoint dominating and paired-dominating sets (Q719018) (← links)
- Upper paired-domination in claw-free graphs (Q719019) (← links)
- A characterization of cubic graphs with paired-domination number three-fifths their order (Q968213) (← links)
- Labelling algorithms for paired-domination problems in block and interval graphs (Q987497) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees (Q1032812) (← 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)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)