Animation Visualization for Vertex Coloring of Polyhedral Graphs

Hidetoshi Nonaka.


Vertex coloring of a graph is the assignment of labels to the vertices of the graph so that adjacent vertices have different labels. In the case of polyhedral graphs, the chromatic number is 2, 3, or 4. Edge coloring problem and face coloring problem can be converted to vertex coloring problem for appropriate polyhedral graphs.

We have been developed an interactive learning system of polyhedra, based on graph operations and simulated elasticity potential method, mainly for educational purpose.

In this paper, we introduce a learning subsystem of vertex coloring, edge coloring and face coloring, based on minimum spanning tree and degenerated polyhedron, which is introduced in this paper.

Full Paper in PDF Document


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: