The multiple domination and limited packing problems in graphs
type: Item
instance of: scholarly article
title: The multiple domination and limited packing problems in graphs
zbMATH Open document ID: 1260.68152
author: V. Leoni
author: M. P. Dobson
author: G. Nasini
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6150502
zbMATH Keywords: graph algorithms
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.09.002
OpenAlex ID: W2042334879
cites work: Characterizations of totally balanced matrices
cites work: Balanced matrices
cites work: The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
cites work: Domination, independent domination, and duality in strongly chordal graphs
cites work: Limited packings in graphs
cites work: Q3836509
cites work: Q4954442
cites work: Q4552196
cites work: Weakly triangulated graphs
cites work: Totally-Balanced and Greedy Matrices
cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time
cites work: A tree representation for \(P_ 4\)-sparse graphs
cites work: On a unique tree representation for \(P_ 4\)-extendible graphs
cites work: A New Class of Brittle Graphs
cites work: Algorithmic aspect of \(k\)-tuple domination in graphs.
cites work: \(k\)-tuple domination in graphs
cites work: Doubly Lexical Orderings of Matrices
DOI: 10.1016/J.IPL.2011.09.002
description: scientific article; zbMATH DE number 6150502