A discharging method to find subgraphs having two edge-disjoint spanning trees. (Q5206367)
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 7144789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A discharging method to find subgraphs having two edge-disjoint spanning trees. |
scientific article; zbMATH DE number 7144789 |
Statements
18 December 2019
0 references
Hamiltonian connected graph
0 references
line graph
0 references
edge-disjoint spanning trees
0 references
0.7870760560035706
0 references
0.774562656879425
0 references
0.7736192941665649
0 references
0.7638842463493347
0 references
0.7576389312744141
0 references
