scientific article; zbMATH DE number 3869360

From MaRDI portal
Publication:3337491





[For the entire collection see Zbl 0536.00004.] The problem of determining s-regular cubic graphs can be reduced to a series of coset enumerations. This problem and the way in which graphical constructions can be used to illuminate the results of the coset enumeration computations are discussed.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337491)