Semitotal domination on AT-free graphs and circle graphs

DOI10.1007/978-3-030-67899-9_5OpenAlexW3126695688MaRDI QIDQ831692

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 algorithmNP-completenessgraph algorithmsdominationAT-free graphscircle graphssemitotal domination

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected dominating set. Theory and applications
• Independence and domination in polygon graphs
• Vertices contained in all or in no minimum semitotal dominating set of a tree
• A survey of selected recent results on total domination in graphs
• The complexity of domination problems in circle graphs
• Algorithmic aspects of semitotal domination in graphs
• Domination and total domination on asteroidal triple-free graphs
• Edge weighting functions on semitotal dominating sets
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
• On matching and semitotal domination in graphs
• On Hadwiger's Number and the Stability Number
• Asteroidal Triple-Free Graphs
• Total Domination in Graphs
• Semitotal domination in claw-free cubic graphs

This page was built for publication: Semitotal domination on AT-free graphs and circle graphs