Efficient and perfect domination on circular-arc graphs

DOI10.1016/j.endm.2015.07.051zbMath1347.05146arXiv1502.01523OpenAlexW1487951463MaRDI QIDQ324824

Michel J. Mizrahi, Min Chih Lin, Jayme Luiz Szwarcfiter

Publication date: 17 October 2016

Full work available at URL: https://arxiv.org/abs/1502.01523

zbMATH Keywords

circular-arc graphsefficient dominationperfect domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Perfect edge domination: hard and solvable cases ⋮ Efficient and perfect domination on circular-arc graphs ⋮ Modelling and solving the perfect edge domination problem

Cites Work

• Efficient and perfect domination on circular-arc graphs
• Efficient graph representations
• Linear-time recognition of circular-arc graphs
• Perfect edge domination and efficient edge domination in graphs
• Fast algorithms for some dominating induced matching problems
• Algorithms for clique-independent sets on subclasses of circular-arc graphs
• On cliques of Helly Circular-arc Graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs

This page was built for publication: Efficient and perfect domination on circular-arc graphs