Generating the Nine-Point Graphs

DOI10.2307/2005705MaRDI QIDQ4777329zbMATH OpenOpenAlexFDO

Authors H. H. Baker, A. K. Dewdney, Andrew L. Szilard

Publication date 1974

Full work available at URL https://doi.org/10.2307/2005705

zbMATH Keywords

programMACRO-10 assembly language

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Enumeration in graph theory (05C30) Software, source code, etc. for problems pertaining to combinatorics (05-04) Computational methods for problems pertaining to combinatorics (05-08)

Recommendations

• Publication:3199427
• Publication:3474686
• Graph designs of four kinds of graphs with nine vertices and nine edges
• Order nine MMIK graphs
• scientific article; zbMATH DE number 4103106
• Graph designs for nine graphs with six vertices and nine edges
• Graph designs of three graphs with nine vertices and nine edges
• Graph designs for a nine-edge six-vertex graph

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3383914 (Why is no real title available?)
• scientific article; zbMATH DE number 3388544 (Why is no real title available?)
• A Catalogue of Combinatorial Geometries
• An Efficient Algorithm for Graph Isomorphism
• Generation of Permutations by Adjacent Transposition

Cited in

(2)

• Reconstruction of small graphs and digraphs
• Generating Nonisomorphic Maps without Storing Them

This page was built for publication: Generating the Nine-Point Graphs

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