Perfect path double covers in every simple graph (Q5203059)
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 4196003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect path double covers in every simple graph |
scientific article; zbMATH DE number 4196003 |
Statements
Perfect path double covers in every simple graph (English)
0 references
1990
0 references
perfect path
0 references
double cover
0 references
polynomial algorithm
0 references
0.8977674841880798
0 references
0.8128217458724976
0 references
0.8105666041374207
0 references
0.8015207648277283
0 references
