Anti-Ramsey numbers for three classes of special subgraphs in wheel graph(轮图中三类特殊子图的anti-Ramsey数)
A subgraph in an edge-colored graph is called rainbow, if all its edges have different colors. Given two graphs G and H, the anti-Ramsey number for H in G, denoted by ar(G,H), is the maximum number of colors in an edge-coloring of G such that G contains no rainbow copy of H. In this paper, we determ...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Artigo |
| Idioma: | Chinês |
| Publicat: |
Zhejiang University Press
2024-09-01
|
| Col·lecció: | Zhejiang Daxue xuebao. Lixue ban |
| Matèries: | |
| Accés en línia: | https://doi.org/10.3785/j.issn.1008-9497.2024.05.005 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|