Ordered coloring grids and related graphs

Bar-Noy, A; Cheilaris, P; Lampis, M; Mitsou, V; Zachos, S

dc.contributor.author	Bar-Noy, A	en
dc.contributor.author	Cheilaris, P	en
dc.contributor.author	Lampis, M	en
dc.contributor.author	Mitsou, V	en
dc.contributor.author	Zachos, S	en
dc.date.accessioned	2014-03-01T02:52:44Z
dc.date.available	2014-03-01T02:52:44Z
dc.date.issued	2010	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36025
dc.subject	Conflict-free coloring	en
dc.subject	Grid graph	en
dc.subject	Ordered coloring	en
dc.subject	Vertex ranking	en
dc.subject.other	Conflict free	en
dc.subject.other	Conflict-free coloring	en
dc.subject.other	Grid graph	en
dc.subject.other	Grid graphs	en
dc.subject.other	Vertex-ranking	en
dc.subject.other	Cellular neural networks	en
dc.subject.other	Coloring	en
dc.title	Ordered coloring grids and related graphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-11476-2_4	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-11476-2_4	en
heal.publicationDate	2010	en
heal.abstract	We investigate a coloring problem, called ordered coloring, in grids and some other families of grid-like graphs. Ordered coloring (also known as vertex ranking) is related to conflict-free coloring and other traditional coloring problems. Such coloring problems can model (among others) efficient frequency assignments in cellular networks. Our main technical results improve upper and lower bounds for the ordered chromatic number of grids and related graphs. To the best of our knowledge, this is the first attempt to calculate exactly the ordered chromatic number of these graph families. © 2010 Springer.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-642-11476-2_4	en
dc.identifier.volume	5869 LNCS	en
dc.identifier.spage	30	en
dc.identifier.epage	43	en