Tuple domination on graphs with the consecutive-zeros property

The $k$-tuple domination problem, for a fixed positive integer $k$, is to find a minimum sized vertex subset such that every vertex in the graph is dominated by at least $k$ vertices in this set. The $k$-tuple domination is NP-hard even for chordal graphs. For the class of circular-arc graphs, its c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Dobson, María Patricia, Leoni, Valeria, Pujato, María Inés Lopez
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!