Old Web
English
Sign In
Adjacent-vertex-distinguishing-total coloring
In graph theory, a total coloring is a coloring on the vertices and edges of a graph such that: In graph theory, a total coloring is a coloring on the vertices and edges of a graph such that:
Parent Topic
Child Topic
No Parent Topic
Email Address
acemap@cs.sjtu.edu.cn
- CCF Conference Analysis
- Map Galaxy
- Academic Report
- What's New
© Copyright 2015-2020 Acemap, Inc. Shanghai Jiao Tong University.