An Enumeration of Certain Equivalence Classes of Directed Multigraphs Having 0 to 5 Nodes with Each Node Having 2 Incoming and 2 Outgoing Arcs
C. C. Briggs
Abstract
An enumeration is given of certain equivalence classes of directed multigraphs having 0 to 5 nodes with each node having 2 incoming and 2 outgoing arcs.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.