| dc.creator |
Yetim, Mehmet Akif |
|
| dc.date |
2021-02-01T00:00:00Z |
|
| dc.date.accessioned |
2021-12-03T12:03:38Z |
|
| dc.date.available |
2021-12-03T12:03:38Z |
|
| dc.identifier |
dbc1e9d9-3d7a-4788-8da9-6ebb160b2b35 |
|
| dc.identifier |
10.1142/s1793830920500937 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/dbc1e9d9-3d7a-4788-8da9-6ebb160b2b35/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/95276 |
|
| dc.description |
We provide upper bounds on the chromatic number of the square of graphs, which have vertex ordering characterizations. We prove that G(2) is (3 Delta - 2)-colorable when G is a cocomparability graph, (Delta + mu)-colorable when G is a strongly orderable graph and (Delta + 1)-colorable when G is a dually chordal graph, where Delta(G) is the maximum degree and mu(G) = max{vertical bar N-G(x) boolean AND N-G(y)vertical bar: x, y is an element of V (G)} is the multiplicity of the graph G. This improves the currently known upper bounds on the chromatic number of squares of graphs from these classes. |
|
| dc.language |
eng |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
Coloring squares of graphs via vertex orderings |
|
| dc.type |
info:eu-repo/semantics/article |
|