On the square coloring of comparability graphs
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, cilt.14, sa.04, 2022 (ESCI, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 14 Sayı: 04
- Basım Tarihi: 2022
- Doi Numarası: 10.1142/s1793830921501391
- Dergi Adı: DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
- Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus
- Anahtar Kelimeler: 2-distance coloring, comparability graph, square graph, chromatic number
- Süleyman Demirel Üniversitesi Adresli: Evet
Özet
We find sufficient conditions for the square of a comparability graph Comp(P) of a poset P to be (Delta + r)-colorable when Comp(P) lacks K-2(,r) for some r >= 1. Furthermore, we show that the problem of coloring the square of the comparability graph of a poset of height at least four can be reduced to the case of height three, where the height of a poset is the size of a maximum chain.