Results on the star edge chromatic number of Knödel graphs
Ars Combinatoria · 12.05.2026 · 167 · 103-113
DOI: 10.61091/ars167-06 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, online erschienen am 12.05.2026. Verfasst von S. Palaniammal.
Abstract (Originalsprache)
A star edge coloring of a graph \(G\) is a proper edge coloring in which every path or cycle on four vertices contains at least three distinct colors. The star edge chromatic number of \(G\), denoted by \(\chi^\prime_{\mathrm{st}}(G)\), is the minimum number of colors required for such a coloring. In this paper, we study the star edge chromatic number of several graph classes derived from the Knödel graph \(W_{\Delta,n}\). In particular, we determine bounds and exact values for \(\chi^\prime_{\mathrm{st}}(G)\) for the Knödel graph \(W_{\Delta,n}\), its middle graph \(M\!\left(W_{\Delta,n}\right)\), and its Mycielskian \(\mu\!\left(W_{\Delta,n}\right)\). Furthermore, we provide explicit constructions of star edge colorings that attain these values.
Zitieren
APA
Palaniammal, S. (2026). Results on the star edge chromatic number of Knödel graphs. Ars Combinatoria, 167, 103-113. https://doi.org/10.61091/ars167-06
Vancouver
Palaniammal S. Results on the star edge chromatic number of Knödel graphs. Ars Combinatoria. 2026;167:103-113. doi:10.61091/ars167-06
BibTeX
@article{Palaniammal2026,
author = {Palaniammal, S.},
title = {Results on the star edge chromatic number of Knödel graphs},
journal = {Ars Combinatoria},
year = {2026},
volume = {167},
pages = {103--113},
doi = {10.61091/ars167-06}
}
EUVIMED