Semitotal domination on AT-free graphs and circle graphs
From MaRDI portal
Publication:831692
DOI10.1007/978-3-030-67899-9_5OpenAlexW3126695688MaRDI QIDQ831692FDOQ831692
Authors: Ton Kloks, Arti Pandey 
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_5
approximation algorithmgraph algorithmsNP-completenessdominationAT-free graphscircle graphssemitotal domination
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- Asteroidal Triple-Free Graphs
- Domination and total domination on asteroidal triple-free graphs
- On Hadwiger's Number and the Stability Number
- The complexity of domination problems in circle graphs
- Independence and domination in polygon graphs
- Connected dominating set. Theory and applications
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in graphs
- Edge weighting functions on semitotal dominating sets
- On matching and semitotal domination in graphs
- Vertices contained in all or in no minimum semitotal dominating set of a tree
- Algorithmic aspects of semitotal domination in graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Cited In (1)
This page was built for publication: Semitotal domination on AT-free graphs and circle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831692)
