Matches in DBpedia 2014 for { <http://dbpedia.org/resource/T-coloring> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- T-coloring abstract "In graph theory, a T-Coloring of a graph , given the set T of nonnegative integers containing 0, is a function of colors (positive integers) to the vertices of G such that if . In simple words, the distance between two colors of adjacent vertices must not belong to fixed set T. The concept was introduced by William K. Hale. If T = {0} it reduces to common vertex coloring.The complementary coloring of T-coloring c, denoted is defined for each vertex v of G bywhere s is the largest color assigned to a vertex of G by the c function.".
- T-coloring thumbnail T-colorings.png?width=300.
- T-coloring wikiPageID "38341734".
- T-coloring wikiPageRevisionID "535205340".
- T-coloring hasPhotoCollection T-coloring.
- T-coloring subject Category:Graph_coloring.
- T-coloring comment "In graph theory, a T-Coloring of a graph , given the set T of nonnegative integers containing 0, is a function of colors (positive integers) to the vertices of G such that if . In simple words, the distance between two colors of adjacent vertices must not belong to fixed set T. The concept was introduced by William K. Hale.".
- T-coloring label "T-coloring".
- T-coloring sameAs m.0qfnll9.
- T-coloring sameAs Q7667902.
- T-coloring sameAs Q7667902.
- T-coloring wasDerivedFrom T-coloring?oldid=535205340.
- T-coloring depiction T-colorings.png.
- T-coloring isPrimaryTopicOf T-coloring.