Total 2-domination of proper interval graphs

DOI10.1016/J.DAM.2021.07.015OpenAlexW3186873274MaRDI QIDQ2043384

Francisco J. Soulignac

Publication date: 2 August 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

proper interval graphsstraight oriented graphstotal 2-domination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• On the algorithmic complexity of \(k\)-tuple total domination
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• A width parameter useful for chordal and co-comparability graphs
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
• On the Algorithmic Complexity of Total Domination
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs

This page was built for publication: Total 2-domination of proper interval graphs