Paired versus double domination in K₁,r-free graphs
From MaRDI portal
Publication:2015806
Recommendations
Cites work
- scientific article; zbMATH DE number 1185309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1792607 (Why is no real title available?)
- scientific article; zbMATH DE number 2188616 (Why is no real title available?)
- A realization algorithm for double domination in graphs
- Algorithmic aspect of k-tuple domination in graphs.
- Characterizations of trees with equal paired and double domination numbers
- Paired-domination in \(P_{5}\)-free graphs
- Paired-domination in claw-free cubic graphs
- Paired-domination in generalized claw-free graphs
- Paired-domination in graphs
- Paired-domination in subdivided star-free graphs
- Paired-domination of Cartesian products of graphs
- Upper bounds on the paired-domination number
- \(k\)-tuple domination in graphs
Cited in
(10)- scientific article; zbMATH DE number 2188616 (Why is no real title available?)
- Paired-domination in subdivided star-free graphs
- Total domination versus paired domination
- Upper paired domination versus upper domination
- scientific article; zbMATH DE number 1416471 (Why is no real title available?)
- Paired domination in graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Paired versus double domination in forbidden graph classes
- Total domination versus paired-domination in regular graphs
- Multiple domination
This page was built for publication: Paired versus double domination in \(K_{1,r}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015806)