scientific article; zbMATH DE number 4068908

MaRDI QIDQ3801581zbMATH OpenFDO

Authors Teruhiro Shirakura, Shinsei Tazawa

Publication date 1986

zbMATH Keywords

enumerationmultigraphsPólya's theorem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cited in

(4)

• A series of search designs for \(2^ m\) factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions
• Enumeration of unlabelled bicolored graphs by degree parities
• Enumeration of connected graphs with cut vertices
• Efficient enumeration of non-isomorphic Ptolemaic graphs

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 Q3801581)