Decomposing 4-connected planar triangulations into two trees and one path (Q1633745)
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: Decomposing 4-connected planar triangulations into two trees and one path |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing 4-connected planar triangulations into two trees and one path |
scientific article |
Statements
Decomposing 4-connected planar triangulations into two trees and one path (English)
0 references
20 December 2018
0 references
planar graphs
0 references
decomposition into trees
0 references
0 references
0 references
0.7947207093238831
0 references
0.7885319590568542
0 references
0.7873671054840088
0 references
0.773770272731781
0 references
0.768914520740509
0 references
