Graphs and combinatorics, 2022-02, Vol.38 (1), Article 12
2022
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- On the Number of Heterochromatic Trees in Nice and Beautiful Colorings of Complete Graphs
- Ist Teil von
- Graphs and combinatorics, 2022-02, Vol.38 (1), Article 12
- Ort / Verlag
- Tokyo: Springer Japan
- Erscheinungsjahr
- 2022
- Quelle
- Alma/SFX Local Collection
- Beschreibungen/Notizen
- We introduce classes of edge-colourings of the complete graph—that we call nice and beautiful—and study how many heterochromatic spanning trees appear under such colourings. We prove that if the colouring is nice, there is at least a quadratic number of different heterochromatic trees; and if the colouring is beautiful there is an exponential number of different such trees.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0911-0119eISSN: 1435-5914DOI: 10.1007/s00373-021-02436-0Titel-ID: cdi_proquest_journals_2612069663
- Format
- –
- Schlagworte
- Combinatorics, Engineering Design, Graph coloring, Graph theory, Mathematics, Mathematics and Statistics, Original Paper, Trees (mathematics)