Generalized Fractional and Circular Total Colorings of Graphs
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 co...
Main Authors: | Kemnitz Arnfried, Marangio Massimiliano, Mihók Peter, Oravcová Janka, Soták Roman |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1812 |
Similar Items
Similar Items
-
Fractional (P,Q)-Total List Colorings of Graphs
by: Kemnitz Arnfried, et al.
Published: (2013-03-01) -
T-Colorings, Divisibility and the Circular Chromatic Number
by: Janczewski Robert, et al.
Published: (2021-05-01) -
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
by: Chen Xiang’en, et al.
Published: (2013-05-01) -
Generalized Fractional Total Colorings of Graphs
by: Karafová Gabriela, et al.
Published: (2015-08-01) -
Local coloring of self complementary graphs
by: P. Deepa, et al.
Published: (2017-04-01)