An Enumeration of Certain Equivalence Classes of Directed Multigraphs Having 0 to 5 Nodes with Each Node Having 2 Incoming and 2 Outgoing Arcs

Simple item page
dc.creatorBriggs, C. C.
dc.date1999-03-24
dc.date2000-08-03
dc.date.accessioned2026-07-07T05:28:27Z
dc.date.available2026-07-07T05:28:27Z
dc.descriptionAn 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.
dc.descriptionPDF file, 14 pages, 123 figures. Figures clarified, typos related to Classes 4,22,6 and 4,23,96 fixed
dc.identifierhttps://arxiv.org/abs/math/9903144
dc.identifierhttp://arxiv.org/abs/math/9903144
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78265
dc.subjectCombinatorics
dc.titleAn Enumeration of Certain Equivalence Classes of Directed Multigraphs Having 0 to 5 Nodes with Each Node Having 2 Incoming and 2 Outgoing Arcs
dc.typetext

Files

Collections

arXiv