Similarities between Brooks' theorem and Regular icosahedron
Brooks' theorem and Regular icosahedron have 3 things in common (in Unionpedia): Graph (discrete mathematics), Graph coloring, Regular graph.
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
Brooks' theorem and Graph (discrete mathematics) · Graph (discrete mathematics) and Regular icosahedron ·
Graph coloring
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.
Brooks' theorem and Graph coloring · Graph coloring and Regular icosahedron ·
Regular graph
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency.
Brooks' theorem and Regular graph · Regular graph and Regular icosahedron ·
The list above answers the following questions
- What Brooks' theorem and Regular icosahedron have in common
- What are the similarities between Brooks' theorem and Regular icosahedron
Brooks' theorem and Regular icosahedron Comparison
Brooks' theorem has 27 relations, while Regular icosahedron has 163. As they have in common 3, the Jaccard index is 1.58% = 3 / (27 + 163).
References
This article shows the relationship between Brooks' theorem and Regular icosahedron. To access each article from which the information was extracted, please visit: