scientific article; zbMATH DE number 125494
From MaRDI portal
Publication:4027196
[For the entire collection see Zbl 0748.00023.] Using the definition of \(k\)-free, a known result can be re-stated as follows: If \(G\) is not edge-reconstructible then \(G\) is \(k\)-free, for all even \(k\). It is known that trees are edge-reconstructible; but an alternative proof of this can be obtained by combining the result above with the result outlined here that, apart from paths, all trees (except a finite number, which are determined) are not 2-free. The approach may be of use in obtaining further results on edge-reconstruction.
Recommendations
- Trees with distinguishing number two
- The 2-dimension of a tree
- Trees with 2-reinforcement number three
- Trees whose 2-domination subdivision number is 2
- Two-graphs and trees
- Trees whose double domination number is twice their domination number
- Graph Drawing
- Two trees which are self-intersecting when drawn simultaneously
- Two-step graphs of trees
- The specification of 2-trees
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027196)