Decomposing graphs into internally-disjoint induced paths (Q5205872)
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: Decomposing graphs into internally-disjoint induced paths |
scientific article; zbMATH DE number 7143788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing graphs into internally-disjoint induced paths |
scientific article; zbMATH DE number 7143788 |
Statements
17 December 2019
0 references
graphoidal decomposition
0 references
induced acyclic graphoidal decomposition
0 references
induced acyclic graphoidal decomposition number
0 references
0.9045963287353516
0 references
0.8734663724899292
0 references
0.8557114005088806
0 references
0.824444055557251
0 references
0.7675076723098755
0 references
