On the difference between the maximum multiplicity and path cover number for tree-like graphs (Q2568981)
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 2214850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the difference between the maximum multiplicity and path cover number for tree-like graphs |
scientific article; zbMATH DE number 2214850 |
Statements
On the difference between the maximum multiplicity and path cover number for tree-like graphs (English)
0 references
17 October 2005
0 references
vertex-sums
0 references
unicyclic graphs
0 references
block-cycle graphs
0 references
0.7909091114997864
0 references
0.7856453657150269
0 references
0.7832136750221252
0 references
0.7804912328720093
0 references
0.7758949995040894
0 references
