Výsledky vyhledávání - "Oravcová Janka"

Report

On a problem concerning integer distance graphs

For $D$ being a subset of positive integers, the integer distance graph is the graph $G(D)$, whose vertex set is the set of integers, and edge set is the set of all pairs $uv$ with $|u-v| \in D$. It is known that $\chi(G(D)) \leq |D|+1$. This article

Externí odkaz: http://arxiv.org/abs/2401.12347

Zobrazit plný text záznamu

Akademický článek

Generalized Fractional and Circular Total Colorings of Graphs

Autor: Kemnitz Arnfried, Marangio Massimiliano, Mihók Peter, Oravcová Janka, Soták Roman

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 35, Iss 3, Pp 517-532 (2015)

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

Externí odkaz: https://doaj.org/article/6018a8055cd54585a87741f82d697efd