Partitioning graphs into induced subgraphs (Q2283104): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Parameterized Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5091008 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3455032 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitioning graphs into induced subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Elements of finite model theory. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3539854 / rank | |||
Normal rank | |||
Latest revision as of 07:57, 21 July 2024
scientific article; zbMATH DE number 6725148
- Partitioning Graphs into Induced Subgraphs
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning graphs into induced subgraphs |
scientific article; zbMATH DE number 6725148 |
|
Statements
Partitioning graphs into induced subgraphs (English)
0 references
Partitioning Graphs into Induced Subgraphs (English)
0 references
30 December 2019
0 references
1 June 2017
0 references
graph matching
0 references
graph partitioning
0 references
parameterized complexity
0 references
dense graphs
0 references
generalized matching
0 references
parametrized complexity
0 references
0 references
