Pages that link to "Item:Q2384392"
From MaRDI portal
The following pages link to Paired domination on interval and circular-arc graphs (Q2384392):
Displayed 31 items.
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\) (Q491215) (← links)
- 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)
- Total domination versus paired-domination in regular graphs (Q1708402) (← 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)
- Paired-domination number of claw-free odd-regular graphs (Q2012885) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← 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)
- Graphs with maximum size and given paired-domination number (Q2449089) (← 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)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)