3-Connected planar graphs are 5-distinguishing colorable with two exceptions.

Gasper Fijavz Seiya Negami Terukazu Sano

Published in: Ars Math. Contemp. (2011)

Keyphrases

planar graphs
minimum weight
connected components
pairwise
dynamic programming
binary images
weighted graph