Degree-associated reconstruction number of graphs
From MaRDI portal
Publication:709303
DOI10.1016/j.disc.2010.03.037zbMath1219.05093MaRDI QIDQ709303
Douglas B. West, Michael D. Barrus
Publication date: 18 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.037
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Adversary degree associated reconstruction number of graphs, Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−2, The adversary degree-associated reconstruction number of double-brooms, A note on the adversary degree associated reconstruction number of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- N-reconstructibility of non-reconstructible digraphs
- On a new digraph reconstruction conjecture
- The degree sequence is reconstructible from \(n-1\) cards
- Almost every graph has reconstruction number three
- The ally-reconstruction number of a tree with five or more vertices is three
- ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
- The graph reconstruction number
- Graph reconstruction—a survey
- A survey on edge reconstruction of graphs
- Reconstructing trees from two cards