Paper Info
Title
On the square coloring of comparability graphs
Abstract
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.
Year
DOI
Venue
2022
10.1142/S1793830921501391
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
Keywords
DocType
Volume
2-distance coloring, comparability graph, square graph, chromatic number
Journal
14
Issue
ISSN
Citations 
04
1793-8309
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Mehmet Akif Yetim100.68