Nonempty intersection of longest paths in a graph with a small matching number (Q2948007)
From MaRDI portal
!
WARNING
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 6486964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonempty intersection of longest paths in a graph with a small matching number |
scientific article; zbMATH DE number 6486964 |
Statements
Nonempty intersection of longest paths in a graph with a small matching number (English)
0 references
29 September 2015
0 references
longest path
0 references
matching number
0 references
0 references
0.9320978
0 references
0.9141017
0 references
0.9124525
0 references
0.90963054
0 references
0.9013839
0 references
0.89978164
0 references
0.89978164
0 references
0.89791304
0 references
0.87826127
0 references
