Covering 2-connected 3-regular graphs with disjoint paths (Q4581271)
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: Covering 2-connected 3-regular graphs with disjoint paths |
scientific article; zbMATH DE number 6919500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering 2-connected 3-regular graphs with disjoint paths |
scientific article; zbMATH DE number 6919500 |
Statements
Covering 2‐connected 3‐regular graphs with disjoint paths (English)
0 references
16 August 2018
0 references
discharging
0 references
path cover
0 references
regular graphs
0 references
0.8494645357131958
0 references
0.8070092797279358
0 references
0.8035709857940674
0 references
0.7974139451980591
0 references
0.796983003616333
0 references
