Neochromatica

Panagiotis Cheilaris; Ernst Specker; Stathis Zachos

Neochromatica

Panagiotis Cheilaris
, Ernst Specker
, Stathis Zachos

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

We create and discuss several modifications to traditional graph color- ing. In particular, we classify various notions of coloring in a proper hierarchy. We concentrate on grid graphs whose colorings can be represented by natural number entries in arrays with various restrictions.

Original language	English
Pages (from-to)	469-480
Number of pages	12
Journal	Commentationes Mathematicae Universitatis Carolinae
Volume	51
Issue number	3
State	Published - 1 Jan 2010

Keywords

Conflict-free
Graph coloring
Paths

ASJC Scopus subject areas

General Mathematics

Cite this

@article{46c94e8a2196465784937013496373c2,

title = "Neochromatica",

abstract = "We create and discuss several modifications to traditional graph color- ing. In particular, we classify various notions of coloring in a proper hierarchy. We concentrate on grid graphs whose colorings can be represented by natural number entries in arrays with various restrictions.",

keywords = "Conflict-free, Graph coloring, Paths",

author = "Panagiotis Cheilaris and Ernst Specker and Stathis Zachos",

note = "Publisher Copyright: {\textcopyright} 2010 Charles University, Faculty of Mathematics and Physics.",

year = "2010",

month = jan,

day = "1",

language = "English",

volume = "51",

pages = "469--480",

journal = "Commentationes Mathematicae Universitatis Carolinae",

issn = "0010-2628",

publisher = "Charles University, Faculty of Mathematics and Physics",

number = "3",

}

TY - JOUR

T1 - Neochromatica

AU - Cheilaris, Panagiotis

AU - Specker, Ernst

AU - Zachos, Stathis

PY - 2010/1/1

Y1 - 2010/1/1

N2 - We create and discuss several modifications to traditional graph color- ing. In particular, we classify various notions of coloring in a proper hierarchy. We concentrate on grid graphs whose colorings can be represented by natural number entries in arrays with various restrictions.

AB - We create and discuss several modifications to traditional graph color- ing. In particular, we classify various notions of coloring in a proper hierarchy. We concentrate on grid graphs whose colorings can be represented by natural number entries in arrays with various restrictions.

KW - Conflict-free

KW - Graph coloring

KW - Paths

UR - https://www.scopus.com/pages/publications/84874842403

M3 - Article

AN - SCOPUS:84874842403

SN - 0010-2628

VL - 51

SP - 469

EP - 480

JO - Commentationes Mathematicae Universitatis Carolinae

JF - Commentationes Mathematicae Universitatis Carolinae

IS - 3

ER -

Neochromatica

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this