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
math.COarXiv:math/9903144
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
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz