@article {IOPORT.05942345,
    author       = {Mih\'ok, Peter and Oravcov\'a, Janka and Sot\'ak, Roman},
    title        = {Generalized circular colouring of graphs.},
    year         = {2011},
    journal      = {Discussiones Mathematicae. Graph Theory},
    volume       = {31},
    number       = {2},
    issn         = {1234-3099},
    pages        = {345-356},
    publisher    = {University of Zielona G\'ora Press, Zielona G\'ora},
    doi          = {10.7151/dmgt.1550},
    abstract     = {Summary: Let ${\mathcal{P}}$ be a graph property and $r,s \in \mathbb{N}$, $r \ge s$. A strong circular $({\mathcal{P}},r,s)$-colouring of a graph $G$ is an assignment $f: V(G) \to \{0,1,\dots, r-1\}$, such that the edges $uv \in E(G)$ satisfying $|f(u)- f(v)| < s$ or $|f(u)- f(v)| > r-s$, induce a subgraph of $G$ with the propery ${\mathcal{P}}$. We present some basic results on strong circular $({\mathcal{P}},r,s)$-colourings. We introduce the strong circular ${\mathcal{P}}$-chromatic number of a graph and we determine the strong circular ${\Cal P}$-chromatic number of complete graphs for additive and hereditary graph properties.},
    identifier   = {05942345},
}