On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2015.01.007 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1994364012 / rank | |||
Normal rank |
Revision as of 01:07, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs |
scientific article |
Statements
On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (English)
0 references
21 May 2015
0 references
computational complexity
0 references
\(\{k\}\)-domination
0 references
\(k\)-tuple domination
0 references
split graphs
0 references
planar graphs
0 references
chordal graphs
0 references