Partitioning a split graph into induced subgraphs that are isomorphic to a path of order 3 (Q6917609)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8104669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a split graph into induced subgraphs that are isomorphic to a path of order 3 |
scientific article; zbMATH DE number 8104669 |
Statements
Partitioning a split graph into induced subgraphs that are isomorphic to a path of order 3 (English)
0 references
13 October 2025
0 references
computational complexity of problems on graphs
0 references
