Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Generalized circular colouring of graphs

Peter Mihók;  Janka Oravcová;  Roman Soták — 2011

Discussiones Mathematicae Graph Theory

Let P be a graph property and r,s ∈ N, r ≥ s. A strong circular (P,r,s)-colouring of a graph G is an assignment f:V(G) → {0,1,...,r-1}, such that the edges uv ∈ E(G) satisfying |f(u)-f(v)| < s or |f(u)-f(v)| > r - s, induce a subgraph of G with the propery P. In this paper we present some basic results on strong circular (P,r,s)-colourings. We introduce the strong circular P-chromatic number of a graph and we determine the strong circular P-chromatic number of complete graphs for additive...

Generalized Fractional and Circular Total Colorings of Graphs

Arnfried Kemnitz;  Massimiliano Marangio;  Peter Mihók;  Janka Oravcová;  Roman Soták — 2015

Discussiones Mathematicae Graph Theory

Let P and Q be additive and hereditary graph properties, r, s ∈ N, r ≥ s, and [ℤr]s be the set of all s-element subsets of ℤr. An (r, s)-fractional (P,Q)-total coloring of G is an assignment h : V (G) ∪ E(G) → [ℤr]s such that for each i ∈ ℤr the following holds: the vertices of G whose color sets contain color i induce a subgraph of G with property P, edges with color sets containing color i induce a subgraph of G with property Q, and the color sets of incident vertices and edges are disjoint. If...

Page 1

Download Results (CSV)