Total graph interpretation of the numbers of the Fibonacci type (Q327721)
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: Total graph interpretation of the numbers of the Fibonacci type |
scientific article; zbMATH DE number 6640981
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Total graph interpretation of the numbers of the Fibonacci type |
scientific article; zbMATH DE number 6640981 |
Statements
Total graph interpretation of the numbers of the Fibonacci type (English)
0 references
19 October 2016
0 references
Summary: We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give the lower bound and the upper bound for the number of all \((A_1, 2 A_1)\)-edge colourings in trees.
0 references
edge colouring
0 references
monochromatic paths
0 references
0 references
