Name
Abstract | ||
|---|---|---|
Let P and Q be additive and hereditary graph properties, r, s is an element of N, r >= s, and [Z(r)](s) be the set of all s-element subsets of Z(r). An (r, s)-fractional (P, Q)-total coloring of G is an assignment h : V(G) boolean OR E(G) -> [Z(r)](s) such that for each i is an element of Z(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 each vertex and edge of G is colored with a set of s consecutive elements of Z(r) we obtain an (r, s)-circular (P, Q)-total coloring of G. In this paper we present basic results on (r, s)-fractional/circular (P, Q)-total colorings. We introduce the fractional and circular (P, Q)-total chromatic number of a graph and we determine this number for complete graphs and some classes of additive and hereditary properties. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.7151/dmgt.1812 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | DocType | Volume |
graph property,(P,Q)-total coloring,circular coloring,fractional coloring,fractional (P, Q)-total chromatic number,circular (P, Q)-total chromatic number | Journal | 35 |
Issue | ISSN | Citations |
3 | 1234-3099 | 1 |
PageRank | References | Authors |
0.41 | 4 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arnfried Kemnitz | 1 | 139 | 20.85 |
| Massimiliano Marangio | 2 | 46 | 8.00 |
| Peter Mihók | 3 | 232 | 44.49 |
| Janka Oravcová | 4 | 1 | 0.75 |
| Roman Soták | 5 | 128 | 24.06 |