scientific article; zbMATH DE number 1051281

zbMath0878.05062MaRDI QIDQ4349617

Brendan D. McKay

Publication date: 7 December 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bipartite graphstriangle-free graphsgraph reconstructionsquare-free graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (12)

The reconstruction conjecture for finite simple graphs and associated directed graphs ⋮ Reconstruction of distance hereditary 2-connected graphs ⋮ Equiangular lines in Euclidean spaces ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model ⋮ Unnamed Item ⋮ Lexicographic products with high reconstruction numbers ⋮ Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups ⋮ Families of pairs of graphs with a large number of common cards ⋮ Reconstruction of small graphs and digraphs ⋮ Recognizing connectedness from vertex-deleted subgraphs ⋮ An Algebraic Formulation of the Graph Reconstruction Conjecture

Uses Software

• nauty

This page was built for publication: