Total graph interpretation of the numbers of the Fibonacci type (Q327721): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q59112021, #quickstatements; #temporary_batch_1705097318925 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59112021 / rank | |||
Normal rank | |||
Revision as of 23:09, 12 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Total graph interpretation of the numbers of the Fibonacci type |
scientific article |
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
