Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, 2023. Verfasst von Gary Chartrand und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
For a graph G and a positive integer k , a royal k -edge coloring of G is an assignment of nonempty subsets of the set { 1 , 2 , … , k } to the edges of G that gives rise to a proper vertex coloring in which the color assigned to each vertex v is the union of the sets of colors of the edges incident with v . If the resulting vertex coloring is vertex-distinguishing, then the edge coloring is a strong royal k coloring. The minimum positive integer k for which a graph has a strong royal k -coloring is the strong royal index of the graph. The primary emphasis here is on strong royal colorings of trees.
Zitieren
APA
Chartrand, G., Hallas, J., & Zhang, P. (2023). Royal Colorings of Graphs. Ars Combinatoria. https://doi.org/10.61091/ars156-6
Vancouver
Chartrand G, Hallas J, Zhang P. Royal Colorings of Graphs. Ars Combinatoria. 2023. doi:10.61091/ars156-6
BibTeX
@article{Chartrand2023,
author = {Chartrand, Gary and Hallas, James and Zhang, Ping},
title = {Royal Colorings of Graphs},
journal = {Ars Combinatoria},
year = {2023},
doi = {10.61091/ars156-6}
}
EUVIMED