Semitotal domination on AT-free graphs and circle graphs

DOI10.1007/978-3-030-67899-9_5MaRDI QIDQ831692zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximation algorithmgraph algorithmsNP-completenessdominationAT-free graphscircle graphssemitotal domination

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A survey of selected recent results on total domination in graphs
• Algorithmic aspects of semitotal domination in graphs
• Asteroidal Triple-Free Graphs
• Connected dominating set. Theory and applications
• Domination and total domination on asteroidal triple-free graphs
• Edge weighting functions on semitotal dominating sets
• Independence and domination in polygon graphs
• On Hadwiger's Number and the Stability Number
• On matching and semitotal domination in graphs
• Semitotal domination in claw-free cubic graphs
• Semitotal domination in graphs
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
• The complexity of domination problems in circle graphs
• Total domination in graphs
• Vertices contained in all or in no minimum semitotal dominating set of a tree

Cited in

(1)

• A linear-time algorithm for semitotal domination in strongly chordal graphs

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)