Login / Signup
The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10.
Xiaohan Cheng
Guanghui Wang
Jianliang Wu
Published in:
J. Comb. Optim. (2017)
Keyphrases
</>
planar graphs
minimum weight
undirected graph
color images
bipartite graph
approximate inference
spanning tree
directed graph
weighted graph
minimum spanning tree
greedy heuristic
objective function
randomized algorithm