On the Palette Index of Complete Bipartite Graphs
Discussiones Mathematicae. Graph Theory, Tome 38 (2018) no. 2, pp. 463-476
Voir la notice de l'article provenant de la source Library of Science
The palette of a vertex x of a graph G determined by a proper edge colouring φ of G is the set φ(xy) : xy ∈ E(G) and the diversity of φ is the number of different palettes determined by φ. The palette index of G is the minimum of diversities of φ taken over all proper edge colourings φ of G. In the article we determine the palette index of Km,n for m ≤ 5 and pose two conjectures concerning the palette index of complete bipartite graphs.
Keywords:
edge colouring, palette index, bipartite graph
@article{DMGT_2018_38_2_a9,
author = {Hor\v{n}\'ak, Mirko and Hud\'ak, Juraj},
title = {On the {Palette} {Index} of {Complete} {Bipartite} {Graphs}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {463--476},
publisher = {mathdoc},
volume = {38},
number = {2},
year = {2018},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2018_38_2_a9/}
}
Horňák, Mirko; Hudák, Juraj. On the Palette Index of Complete Bipartite Graphs. Discussiones Mathematicae. Graph Theory, Tome 38 (2018) no. 2, pp. 463-476. http://geodesic.mathdoc.fr/item/DMGT_2018_38_2_a9/