Publisher
Springer Berlin Heidelberg
Reference45 articles.
1. Arjomandi, E. and Corneil, D. G., "Unicyclic graphs satisfy Harary's conjecture," Canad. Math. Bull., to appear.
2. Beineke, L. W., and Parker, E. M., "On nonreconstructable tournaments," J. Combinatorial Theory 9 (1970) 324–326.
3. Bondy, J. A., "On Kelly's congruence theorem for trees," Proc. Cambridge Philos. Soc. 65 (1969), 1–11.
4. Bondy, J. A., "On Ulam's Conjecture for separable graphs," Pacific J. Math. 31 (1969), 281–288.
5. Bondy, J. A., and Hemminger, R. L., "Almost reconstructing infinite graphs," Pacific J. Math., to appear.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the computation of Seidel Laplacian eigenvalues for graph-based binary codes;Discrete Mathematics;2024-07
2. Reconstruction of old maps based on old photos using fuzzy graphs;Journal of Applied Mathematics and Computing;2024-06-16
3. References;Graphs, Orders, Infinites and Philosophy;2023-03-31
4. Reconstructing Graphs from Connected Triples;Graph-Theoretic Concepts in Computer Science;2023
5. Seurat games on Stockmeyer graphs;Journal of Graph Theory;2021-09-24