T-coloring

Known as: T-colorings

The complementary coloring of T-coloring c, denoted is defined for each vertex v of G by where s is the largest color assigned to a vertex of G by…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2020

Cloud computing is foreseen to upset the Information and Communication Technology segment and has been a standard of research…

2014

A proper t-coloring of a graph G is a mapping $${\varphi: V(G) \rightarrow [1, t]}$$ such that $${\varphi(u) \neq \varphi(v…

2013

An edge-coloring of a graph $G$ with colors $1,\ldots,t$ is called an interval $t$-coloring if all colors are used, and the…

2011

A generalization of the classical graph coloring model is studied in this paper. The problem we are interested in is the T…

2008

2004

A Grünbaum coloring of a triangulation is an assignment of colors to edges so that the edges about each face are assigned unique…

2003

The T-coloring problem is, given a graph G = (V, E), a set T of nonnegative integers containing 0, and a ‘span’ bound s 2 0, to…

2000

Abstract. A method of proof is given for obtaining lower bounds on strip discrepancy when the distributions do not have atoms…

1999

Abstract. Suppose G is a graph and T is a set of non-negative integers that contains 0. A T-coloring of G is an assignment of a…

1995

Motivated by a problem in Scheduling Theory, we introduce the χt-coloring problem, a generalization of the chromatic number…