Reconstructing graphs from their k-edge deleted subgraphs (original) (raw)

A reduction of the Graph Reconstruction Conjecture

Mathematics Head

Discussiones Mathematicae Graph Theory, 2014

View PDFchevron_right

The Reconstruction of Graphs

Dhananjay Mehendale

arXiv (Cornell University), 2005

View PDFchevron_right

Small graphs are reconstructible

Brendan McKay

Australasian Journal of Combinatorics, 1997

View PDFchevron_right

Reconstructing graphs from size and degree properties of their induced k-subgraphs

Yair Caro

View PDFchevron_right

Bipartite Permutation Graphs Are Reconstructible

Ryuhei Uehara

Discrete Mathematics, Algorithms and Applications, 2012

View PDFchevron_right

Some work towards the proof of the reconstruction conjecture

Vineet Paliwal

Discrete Mathematics, 2003

View PDFchevron_right

FROM RECONSTRUCTION CONJECTURE TOWARDS A LEMMA

Debajit Sensarma

airccse.org

View PDFchevron_right

Reconstruction of bipartite graphs and triangle-free graphs with connectivity two

S. Monikandan

View PDFchevron_right

A Note on the Adversary Degree Associated Reconstruction Number of Graphs

S. Monikandan

Journal of Discrete Mathematics, 2013

View PDFchevron_right

The (leq6)(\leq 6)(leq6)-half-reconstructibility of digraphs

rahma salem

View PDFchevron_right

Reconstruction of a graph from 2-vicinities of its vertices

Eugene Kon

Discrete Applied Mathematics, 2008

View PDFchevron_right

Combinatorial reconstruction problems

Yair Caro

Journal of Combinatorial Theory, Series B, 1989

View PDFchevron_right

Reconstruction of the set of branches of a graph Graphs and Combinatorics Reconstruction of the Set of Branches of a Graph

Yongzhi Yang

View PDFchevron_right

Spectral conditions for the reconstructibility of a graph

Brendan McKay

Journal of Combinatorial Theory, Series B, 1981

View PDFchevron_right

On disconnected graph with large reconstruction number

Josef Lauri

Ars Combinatoria, 2002

View PDFchevron_right

Adversary degree associated reconstruction number of graphs

S. Monikandan

Discrete Mathematics, Algorithms and Applications, 2015

View PDFchevron_right

The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements

Elias Hagos

Electronic Journal of Combinatorics, 2000

View PDFchevron_right

The reconstruction of maximal planar graphs. I. Recognition

Stanley Fiorini

Journal of Combinatorial Theory, Series B, 1981

View PDFchevron_right

The reconstruction of maximal planar graphs II. Reconstruction

Josef Lauri

Journal of Combinatorial Theory, Series B, 1981

View PDFchevron_right

On replete graphs

Marietjie Frick

Journal of Graph Theory, 1992

View PDFchevron_right

Reconstruction number of graphs with unique pendant vertex

S. Monikandan

Discrete Applied Mathematics, 2020

View PDFchevron_right

Complexity results in graph reconstruction

Stanislaw Radziszowski

Discrete Applied Mathematics, 2007

View PDFchevron_right

On the reconstraction of the matching polynomial and the reconstruction conjecture

SHANAZ WAHID

International Journal of Mathematics and Mathematical Sciences, 1987

View PDFchevron_right

Decomposing complete graphs into K r× K c's

Hung-lin Fu

View PDFchevron_right

Stronger reconstruction of distance-hereditary graphs

Devi Priya

Işık University Press, 2021

View PDFchevron_right

Vertex-switching, isomorphism, and pseudosimilarity

Mark Ellingham

Journal of Graph Theory, 1991

View PDFchevron_right

Reconstructibility of Tree Graphs

Dénes Bartha

View PDFchevron_right

Results and Problems Concerning Edge Transformed Graphs

Louis Quintas

Electronic Notes in Discrete Mathematics, 2000

View PDFchevron_right

On the edge-reconstruction number of a tree

K. Asciak

View PDFchevron_right