\(H\)-domination in graphs (Q1415548): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / cites work | |||
Property / cites work: Q3758869 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3684150 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Permutation graphs: Connected domination and Steiner trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dominating cliques in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paired-domination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3838207 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paired-domination in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On connected cutfree domination in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum dominating cycles in 2-trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3895508 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(03)00187-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1975296290 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:57, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(H\)-domination in graphs |
scientific article |
Statements
\(H\)-domination in graphs (English)
0 references
4 December 2003
0 references
\(H\)-domination
0 references
Paired domination
0 references
Efficient domination
0 references