In:
Mathematical Problems in Engineering, Hindawi Limited, Vol. 2020 ( 2020-09-07), p. 1-5
Kurzfassung:
The anti-Ramsey number A R G , H is the maximum number of colors in an edge-coloring of G such that G contains no rainbow subgraphs isomorphic to H . In this paper, we discuss the anti-Ramsey numbers A R K p 1 , p 2 , … , p k , T n , A R K p 1 , p 2 , … , p k , ℳ , and A R K p 1 , p 2 , … , p k , C of K p 1 , p 2 , … , p k , where T n , ℳ , and C denote the family of all spanning trees, the family of all perfect matchings, and the family of all Hamilton cycles in K p 1 , p 2 , … , p k , respectively.
Materialart:
Online-Ressource
ISSN:
1024-123X
,
1563-5147
DOI:
10.1155/2020/5136104
Sprache:
Englisch
Verlag:
Hindawi Limited
Publikationsdatum:
2020
ZDB Id:
2014442-8
SSG:
11
Permalink