The 1‐2‐3‐conjecture holds for dense graphs (Q4632023)
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: The 1‐2‐3‐conjecture holds for dense graphs |
scientific article; zbMATH DE number 7047771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 1‐2‐3‐conjecture holds for dense graphs |
scientific article; zbMATH DE number 7047771 |
Statements
The 1‐2‐3‐conjecture holds for dense graphs (English)
0 references
25 April 2019
0 references
1-2-3-conjecture
0 references
dense graphs
0 references
edge-weighting
0 references
edge-decomposition
0 references
0.9384103
0 references
0.91768515
0 references
0 references
0.8935559
0 references
0.87943286
0 references
0.87882674
0 references
0.8738318
0 references
0.8695123
0 references
0.86858904
0 references
0.86707366
0 references
