Paired versus double domination in K₁,r-free graphs
From MaRDI portal
Publication:2015806
DOI10.1007/S10878-012-9547-YzbMATH Open1297.90154OpenAlexW2031691607MaRDI QIDQ2015806FDOQ2015806
Authors: Paul Dorbec, Michael A. Henning, Bert L. Hartnell 
Publication date: 24 June 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9547-y
Recommendations
Cites Work
- Title not available (Why is that?)
- Paired-domination in claw-free cubic graphs
- Paired-domination in graphs
- Title not available (Why is that?)
- \(k\)-tuple domination in graphs
- Title not available (Why is that?)
- Paired-domination of Cartesian products of graphs
- Paired-domination in generalized claw-free graphs
- Characterizations of trees with equal paired and double domination numbers
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- Upper bounds on the paired-domination number
- Title not available (Why is that?)
- Paired-domination in subdivided star-free graphs
- Paired-domination in \(P_{5}\)-free graphs
- A realization algorithm for double domination in graphs
Cited In (10)
- Title not available (Why is that?)
- Paired-domination in subdivided star-free graphs
- Total domination versus paired domination
- Upper paired domination versus upper domination
- Title not available (Why is that?)
- 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)
