Change search
ReferencesLink to record
Permanent link

Direct link
Ordered Coloring for Grids and Related Graphs
Show others and affiliations
2011 (English)In: Theoretical Computer Science, ISSN 0304-3975Article in journal (Refereed) Submitted
Abstract [en]

 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.

Place, publisher, year, edition, pages
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-58602OAI: diva2:473411
QS 20120316Available from: 2012-01-05 Created: 2012-01-05 Last updated: 2012-03-16Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lampis, Michael
In the same journal
Theoretical Computer Science
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link