Adjacent-vertex-distinguishing-total coloring
id:
adjacent-vertex-distinguishing-total-coloring-316-7248913
title:
Adjacent-vertex-distinguishing-total coloring
text:
In graph theory, a total coloring is a coloring on the vertices and edges of a graph such that: (1). no adjacent vertices have the same color; (2). no adjacent edges have the same color; and (3). no edge and its endvertices are assigned the same color. In 2005, Zhang et al. added a restriction to the definition of total coloring and proposed a new type of coloring defined as follows. Let G = (V,E) be a simple graph endowed with a total coloring φ, and let u be a vertex of G. The set of colors th
brand slug:
wiki
category slug:
encyclopedia
description:
Type of total coloring in graph theory
original url:
https://en.wikipedia.org/wiki/Adjacent-vertex-distinguishing-total_coloring
date created:
date modified:
2024-02-01T07:19:01Z
main entity:
{"identifier":"Q17005461","url":"https://www.wikidata.org/entity/Q17005461"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/27/Avd-total-coloring-of-complete-graph-K4.svg","width":243,"height":207}
fields total:
13
integrity:
15