bipartite cubic
1Bipartite — means having two parts, or an agreement between two parties. More specifically, it may refer to any of the following:* 2 (number)In mathematics: * Bipartite graph * Bipartite Cubic, a type of Cubic function * Bipartite matching, a type of… …
2Cubic graph — Not to be confused with graphs of cubic functions. The Petersen graph is a Cubic graph …
354-graphe de Ellingham-Horton — Représentation du 54 graphe de Ellingham Horton. Nombre de sommets 54 Nombre d arêtes 81 Distribution des degrés 3 régulier R …
478-graphe de Ellingham-Horton — Représentation du 78 graphe de Ellingham Horton. Nombre de sommets 78 Nombre d arêtes 117 Distribution des degrés 3 régulier …
592-graphe de Horton — Nombre de sommets 92 Nombre d arêtes 138 Distribution des degrés 3 régulier Rayon 11 Diamètre 12 Maille 6 Nombre chromatique 2 …
6Graphe de Horton — Représentation du graphe de Horton. Nombre de sommets 96 Nombre d arêtes 144 Distribution des degrés 3 régulier Rayon 10 …
7Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 …
8Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 …
9Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …
10Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… …
