Harries–Wong graph
In the mathematical field of graph theory, the Harries–Wong graph is a 3-regular undirected graph with 70 vertices and 105 edges.

The Harries–Wong graph has chromatic number 2, chromatic index 3, radius 6, diameter 6, girth 10 and is Hamiltonian. It is also a 3-vertex-connected and 3-edge-connected non-planar cubic graph. It has book thickness 3 and queue number 2.

The characteristic polynomial of the Harries–Wong graph is

: formula_1
Q395
mathematical
Concept
Q131476
graph theory
Concept
Q826467
regular
Concept
Q141488
undirected graph
Concept
Q504843
chromatic number
Concept
Q1050972
chromatic index
Concept
Q273037
Hamiltonian
Concept
Q3115621
vertex-connected
Concept
Q3034655
edge-connected
Concept
Q547823
non-planar
Concept
Q1374495
cubic graph
Concept
Q4942980
book thickness
UNK
Q25303837
queue number
UNK
Q3115503
Harries–Wong graph
Concept
Q3115503
Harries–Wong graph
Concept
Q3115503
Harries–Wong graph
Concept
+3^^http://www.w3.org/2001/XMLSchema#decimal
3
NUMBER
+70^^http://www.w3.org/2001/XMLSchema#decimal
70
NUMBER
+2^^http://www.w3.org/2001/XMLSchema#decimal
2
NUMBER
+3^^http://www.w3.org/2001/XMLSchema#decimal
3
NUMBER
+6^^http://www.w3.org/2001/XMLSchema#decimal
6
NUMBER
+6^^http://www.w3.org/2001/XMLSchema#decimal
6
NUMBER
+10^^http://www.w3.org/2001/XMLSchema#decimal
10
NUMBER
+3^^http://www.w3.org/2001/XMLSchema#decimal
3
NUMBER
+3^^http://www.w3.org/2001/XMLSchema#decimal
3
NUMBER
+3^^http://www.w3.org/2001/XMLSchema#decimal
3
NUMBER
+2^^http://www.w3.org/2001/XMLSchema#decimal
2
NUMBER
+1^^http://www.w3.org/2001/XMLSchema#decimal
1
NUMBER
studies
instance of
part of
studies