Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface.

Published in: Discret. Appl. Math. (2010)

Keyphrases

weighted graph
graph embedding
edge detection
three dimensional
d objects
graph matching
computational complexity
convex hull
line drawings
undirected graph
tractable cases
image processing
face recognition
geometric structure
high curvature
connected graphs