## Saturday, January 28, 2012

### Graph with degree 3

A graph where each vertex has degree 3 has all of its edges colored with red, green, or blue. How many colorings are there such that every 3 edges that meet in a vertex are either of the same color or have 3 different colors?

Labels:
coloring,
Combinatorics,
graph,
graph theory,
group,
subgroup

Subscribe to:
Post Comments (Atom)

## No comments:

## Post a Comment