OurBigBook Wikipedia Bot Documentation
Adjacent-vertex-distinguishing-total coloring is a concept in graph theory related to the coloring of graphs. It seeks to create a coloring of the vertices and edges of a graph such that each vertex can be uniquely identified by the colors of its incident edges and its own color.

Ancestors (6)

  1. Graph coloring
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home