On disjoint maximal independent sets in graphs (Q458376): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
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
