Conditions for graphs to be path partition optimal (Q1709536)
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 6856465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conditions for graphs to be path partition optimal |
scientific article; zbMATH DE number 6856465 |
Statements
Conditions for graphs to be path partition optimal (English)
0 references
5 April 2018
0 references
path partition number
0 references
separable degree
0 references
path partition optimal
0 references
forbidden subgraph
0 references
heavy subgraph
0 references
heft index
0 references
0 references
0.9089483
0 references
0.9021149
0 references
0.89808947
0 references
0.8928622
0 references
0.8924017
0 references
0 references
0 references
