On disjoint maximal independent sets in graphs (Q458376): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6352033 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial problems | |||
Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
independent set | |||
Property / zbMATH Keywords: independent set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dominating set | |||
Property / zbMATH Keywords: dominating set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
forbidden induced subgraph | |||
Property / zbMATH Keywords: forbidden induced subgraph / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.08.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2066049837 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Disjoint cliques and disjoint maximal independent sets of vertices in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4766997 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Disjoint independent dominating sets in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3615799 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Remarks about disjoint dominating sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic aspect of \(k\)-tuple domination in graphs. / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:35, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On disjoint maximal independent sets in graphs |
scientific article |
Statements
On disjoint maximal independent sets in graphs (English)
0 references
7 October 2014
0 references
combinatorial problems
0 references
independent set
0 references
dominating set
0 references
forbidden induced subgraph
0 references