Splitting a graph into disjoint induced paths or cycles. (Q1408827)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Splitting a graph into disjoint induced paths or cycles. |
scientific article; zbMATH DE number 1985926
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Splitting a graph into disjoint induced paths or cycles. |
scientific article; zbMATH DE number 1985926 |
Statements
Splitting a graph into disjoint induced paths or cycles. (English)
0 references
25 September 2003
0 references
two-level clustered graphs
0 references
0 references
0.91057503
0 references
0.91057503
0 references
0.8985757
0 references
0.89000523
0 references
0.88736236
0 references
