Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings (Q327737)
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: Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings |
scientific article; zbMATH DE number 6640987
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings |
scientific article; zbMATH DE number 6640987 |
Statements
Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings (English)
0 references
19 October 2016
0 references
Summary: We determine the smallest and the largest number of \((A, B, 2 C)\)-edge colourings in trees. We prove that the star is a unique tree that maximizes the number of all of the \((A, B, 2 C)\)-edge colourings and that the path is a unique tree that minimizes it.
0 references
Fibonacci numbers in graphs
0 references
0 references
0 references
0.9145669
0 references
0.90216804
0 references
0.90128744
0 references
0 references
0.8976434
0 references
0 references
0.8952757
0 references
