Tuple domination on graphs with the consecutive-zeros property

DOI10.1016/j.entcs.2019.08.036OpenAlexW2978987201WikidataQ113317396 ScholiaQ113317396MaRDI QIDQ2132374

V. Leoni, Maria Inés Lopez Pujato, Maria Patricia Dobson

Publication date: 27 April 2022

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

zbMATH Keywords

stable setslinear timeadjacency matrices\(k\)-tuple dominating sets

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum 2-tuple dominating set of an interval graph
• \(k\)-tuple domination in graphs
• Linear time algorithms on circular-arc graphs
• The multiple domination and limited packing problems in graphs
• On the approximability and exact algorithms for vector domination and related problems in graphs
• Incidence matrices and interval graphs
• Matrix characterizations of circular-arc graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

This page was built for publication: Tuple domination on graphs with the consecutive-zeros property