Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (Q345073)
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 highly edge-connected graphs into homomorphic copies of a fixed tree |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree |
scientific article |
Statements
Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (English)
0 references
25 November 2016
0 references
edge decomposition
0 references
trees
0 references
edge connectivity
0 references
0.8852466344833374
0 references
0.8824081420898438
0 references
0.8743255138397217
0 references
0.8675192594528198
0 references
0.8636418581008911
0 references
