Semipaired domination in maximal outerplanar graphs

DOI10.1007/s10878-019-00427-9zbMath1435.05155OpenAlexW2949015409WikidataQ127716606 ScholiaQ127716606MaRDI QIDQ2331595

Michael A. Henning, Pawaton Kaemawichanurat

Publication date: 29 October 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00427-9

zbMATH Keywords

paired-dominationmaximal outerplanar graphssemipaired domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

Semipaired Domination in Some Subclasses of Chordal Graphs ⋮ Partial domination of maximal outerplanar graphs ⋮ Extensions of the Art Gallery Theorem ⋮ Total domination in plane triangulations ⋮ Bounds on the semipaired domination number of graphs with minimum degree at least two ⋮ Domination and outer connected domination in maximal outerplanar graphs ⋮ Double domination in maximal outerplanar graphs ⋮ Unique minimum semipaired dominating sets in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
• Total domination in maximal outerplanar graphs
• Perfect graphs involving semitotal and semipaired domination
• Total domination in maximal outerplanar graphs. II.
• On dominating sets of maximal outerplanar and planar 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
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• A short proof of Chvatal's Watchman Theorem
• A combinatorial theorem in plane geometry
• Algorithmic aspects of semitotal domination in graphs
• Dominating sets in planar graphs
• On dominating sets of maximal outerplanar graphs
• Edge weighting functions on semitotal dominating sets
• Total dominating sets in maximal outerplanar graphs
• Semipaired domination in claw-free cubic graphs
• Graphs with large semipaired domination number
• On matching and semitotal domination in graphs
• Dominating sets of maximal outerplanar graphs
• Paired-domination in graphs
• Thoroughly dispersed colorings
• Total Domination in Graphs
• Semitotal domination in claw-free cubic graphs
• Semitotal domination in claw-free cubic graphs

This page was built for publication: Semipaired domination in maximal outerplanar graphs