DSpace Repository

On the square coloring of comparability graphs

Show simple item record

dc.creator Yetim, Mehmet Akif
dc.date 2022-05-01T00:00:00Z
dc.identifier 6d5f2930-c280-4bfa-9d3d-2ee6ca3eee57
dc.identifier 10.1142/s1793830921501391
dc.identifier https://avesis.sdu.edu.tr/publication/details/6d5f2930-c280-4bfa-9d3d-2ee6ca3eee57/oai
dc.description 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.
dc.language eng
dc.rights info:eu-repo/semantics/closedAccess
dc.title On the square coloring of comparability graphs
dc.type info:eu-repo/semantics/article


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account