On the complexity of Dominating Set for graphs with fixed diameter
Authors:
- Valentin BouquetVBValentin Bouquet
- François DelbotFDFrançois Delbot
- Christophe PicouleauCPChristophe Picouleau
- Stéphane RovedakisSRStéphane Rovedakis
- 16 April 2024
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1001
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Disconnected cuts in claw-free graphsJournal of Computer and System Sciences, 2020
- Domination When the Stars Are OutACM Transactions on Algorithms, 2019
- Bounding χ in terms of ω and Δ for quasi‐line graphsJournal of Graph Theory, 2008
- Graph Classes: A Survey1999
- Linear time algorithms on circular-arc graphsInformation Processing Letters, 1991
- On diameters and radii of bridged graphsDiscrete Mathematics, 1989
- Edge Dominating Sets in GraphsSIAM Journal on Applied Mathematics, 1980
- An Optimal Algorithm to Detect a Line Graph and Output Its Root GraphJournal of the ACM, 1974