Brinkmann graph
In the mathematical field of graph theory, the Brinkmann graph is a 4-regular graph with 21 vertices and 42 edges discovered by Gunnar Brinkmann in 1992. It was first published by Brinkmann and Meringer in 1997. It has chromatic number 4, chromatic index 5, radius 3, diameter 3 and girth 5. It is also a 3-vertex-connected graph and a 3-edge-connected graph. It is the smallest 4-regular graph of girth 5 with chromatic number 4.
primaryTopic
Brinkmann graph
In the mathematical field of graph theory, the Brinkmann graph is a 4-regular graph with 21 vertices and 42 edges discovered by Gunnar Brinkmann in 1992. It was first published by Brinkmann and Meringer in 1997. It has chromatic number 4, chromatic index 5, radius 3, diameter 3 and girth 5. It is also a 3-vertex-connected graph and a 3-edge-connected graph. It is the smallest 4-regular graph of girth 5 with chromatic number 4.
has abstract
In the mathematical field of g ...... sequence A159192 in the OEIS).
@en
Le graphe de Brinkmann est, en ...... édant 21 sommets et 42 arêtes.
@fr
thumbnail
Wikipage page ID
24,177,385
Wikipage revision ID
699,509,613
automorphisms
chromatic index
chromatic number
image caption
The Brinkmann graph
name
Brinkmann graph
namesake
Gunnar Brinkmann
properties
vertices
hypernym
type
comment
In the mathematical field of g ...... rth 5 with chromatic number 4.
@en
Le graphe de Brinkmann est, en ...... édant 21 sommets et 42 arêtes.
@fr
label
Brinkmann graph
@en
Graphe de Brinkmann
@fr
