On Reconstructing Graphs and Their Complements
From MaRDI portal
Publication:2935256
DOI10.1137/12089332XzbMATH Open1305.05152OpenAlexW2015884035MaRDI QIDQ2935256FDOQ2935256
Authors: William Kocay, Donald L. Kreher 
Publication date: 22 December 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/12089332x
Recommendations
- On the complements of graphs
- On the complexity of graph reconstruction
- scientific article; zbMATH DE number 4023330
- scientific article; zbMATH DE number 4016946
- On the reconstruction of graph invariants
- scientific article; zbMATH DE number 1792585
- Reconstruction of a graph of order \(p\) from its \((p-1)\)-complements
- scientific article; zbMATH DE number 878311
- scientific article; zbMATH DE number 701116
Cited In (16)
- Reconstructing Digraphs from Partial Dadecks
- Triangulating remnants of complete graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The \((\leq 6)\)-half-reconstructibility of digraphs
- A conjecture on the reconstruction of graphs from metric balls of their vertices
- Combinatorial reconstruction problems
- On the complexity of reconstructing H-free graphs from their Star Systems
- Reconstructing graphs from cut-set sizes
- On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices
- Rebuilding convex sets in graphs
- The \((\leq k)\)-half-reconstructability of graphs for \(7\leq k\leq 12\).
- On \({\mathcal C}K_ 1\)-reconstruction of a pair of graphs
- On the reconstruction of planar graphs
- Set recognition of decomposable graphs and steps towards their reconstruction
This page was built for publication: On Reconstructing Graphs and Their Complements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935256)
