Generalized Fractional Total Colorings of Graphs
Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 3, pp. 463-473
Voir la notice de l'article provenant de la source Library of Science
Let 𝒫 and 𝒬 be additive and hereditary graph properties and let r, s be integers such that r ≥ s. Then an r/s-fractional (𝒫,𝒬)-total coloring of a finite graph G = (V, E) is a mapping f, which assigns an s-element subset of the set 1, 2, . . ., r to each vertex and each edge, moreover, for any color i all vertices of color i induce a subgraph with property 𝒫, all edges of color i induce a subgraph with property 𝒬 and vertices and incident edges have been assigned disjoint sets of colors. The minimum ratio of an r/s-fractional (𝒫,𝒬)-total coloring of G is called fractional (𝒫, 𝒬)-total chromatic number χ_f, 𝒫 ,𝒬^'' (G) = r/s. We show in this paper that χ_f, 𝒫 ,𝒬^'' of a graph G with o(V (G)) vertex orbits and o(E(G)) edge orbits can be found as a solution of a linear program with integer coefficients which consists only of o(V (G)) + o(E(G)) inequalities.
Keywords:
fractional coloring, total coloring, automorphism group
@article{DMGT_2015_35_3_a5,
author = {Karafov\'a, Gabriela and Sot\'ak, Roman},
title = {Generalized {Fractional} {Total} {Colorings} of {Graphs}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {463--473},
publisher = {mathdoc},
volume = {35},
number = {3},
year = {2015},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2015_35_3_a5/}
}
Karafová, Gabriela; Soták, Roman. Generalized Fractional Total Colorings of Graphs. Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 3, pp. 463-473. http://geodesic.mathdoc.fr/item/DMGT_2015_35_3_a5/