A note on the line reconstruction problem
From MaRDI portal
Publication:2554706
DOI10.1016/0095-8956(72)90068-8zbMath0244.05112OpenAlexW2091203438MaRDI QIDQ2554706
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90068-8
Related Items (24)
Balance equations for reconstruction problems ⋮ Reconstructing graphs from their k-edge deleted subgraphs ⋮ A survey on edge reconstruction of graphs ⋮ Combinatorial reconstruction problems ⋮ Graphical partially ordered sets ⋮ Inclusion-exclusion: exact and approximate ⋮ Dense graphs and edge reconstructions ⋮ Reconstruction of k-orbits of a permutation group ⋮ A reconstruction problem related to balance equations ⋮ Unique representability and matroid reconstruction ⋮ Intersection theory for graphs ⋮ Reconstruction of infinite graphs ⋮ Edge reconstruction of the Ihara zeta function ⋮ The \(k\)-orbit reconstruction and the orbit algebra ⋮ ON α,β DESTRUCTIBLE GRAPHS ⋮ On the nonreconstructibility of combinatorial geometries ⋮ The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges ⋮ On reconstructing graphs from their sets of subgraphs ⋮ Counterexamples to the Edge Reconstruction Conjecture for infinite graphs ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ A reconstruction problem related to balance equations. II: The general case ⋮ Quotients of Peck posets ⋮ Reconstruction from vertex-switching ⋮ A note on the edge reconstruction conjecture
Cites Work
This page was built for publication: A note on the line reconstruction problem
