| dc.creator |
Civan, Yusuf |
|
| dc.creator |
YALCIN, Erguen |
|
| dc.date |
2007-09-30T21:00:00Z |
|
| dc.date.accessioned |
2020-10-06T09:48:44Z |
|
| dc.date.available |
2020-10-06T09:48:44Z |
|
| dc.identifier |
42644008-10c2-4e5e-bcfe-f3cfde1e8757 |
|
| dc.identifier |
10.1016/j.jcta.2007.02.001 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/42644008-10c2-4e5e-bcfe-f3cfde1e8757/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/58517 |
|
| dc.description |
A vertex coloring of a simplicial complex Delta is called a linear coloring if it satisfies the property that for every pair of facets (F-1, F-2) of Delta, there exists no pair of vertices (v(1), v(2)) with the same color such that v(1) is an element of F-1\F-2 and v(2) is an element of F-2\F-1. The linear chromatic number lchr(Delta) of Delta is defined as the minimum integer k such that Delta has a linear coloring with k colors. We show that if A is a simplicial complex with Ichr(Delta) = k, then it has a subcomplex Delta' with k vertices such that Delta is simple homotopy equivalent to Delta'. As a corollary, we obtain that lchr(Delta) >= Homdim(Delta) + 2. We also show in the case of linearly colored simplicial complexes, the usual assignment of a simplicial complex to a multicomplex has an inverse. Finally, we show that the chromatic number of a simple graph is bounded from above by the linear cht-ornatic number of its neighborhood complex. (C) 2007 Elsevier Inc. All rights reserved. |
|
| dc.language |
eng |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
Linear colorings of simplicial complexes and collapsing |
|
| dc.type |
info:eu-repo/semantics/article |
|