Computer reconstruction of small graphs
From MaRDI portal
Publication:4166785
DOI10.1002/jgt.3190010309zbMath0386.05045OpenAlexW2103497484MaRDI QIDQ4166785
Publication date: 1977
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190010309
Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
The reconstruction conjecture for finite simple graphs and associated directed graphs ⋮ Reconstructibility and perfect graphs ⋮ Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups ⋮ Unnamed Item ⋮ Zero forcing for sign patterns ⋮ Reconstruction of small graphs and digraphs ⋮ More on block intersection polynomials and new applications to graphs and block designs ⋮ Graph theory (algorithmic, algebraic, and metric problems)