Dyck graph
id:
dyck-graph-252-8211196
title:
Dyck graph
text:
In the mathematical field of graph theory, the Dyck graph is a 3-regular graph with 32 vertices and 48 edges, named after Walther von Dyck. It is Hamiltonian with 120 distinct Hamiltonian cycles. It has chromatic number 2, chromatic index 3, radius 5, diameter 5 and girth 6. It is also a 3-vertex-connected and a 3-edge-connected graph. It has book thickness 3 and queue number 2. The Dyck graph is a toroidal graph; the dual of its symmetric toroidal embedding is the Shrikhande graph.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Dyck_graph
date created:
date modified:
2024-02-27T06:51:28Z
main entity:
{"identifier":"Q3115480","url":"https://www.wikidata.org/entity/Q3115480"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/dd/Dyck_graph_hamiltonian.svg","width":480,"height":480}
fields total:
13
integrity:
14