Two classes of non-Leech trees
From MaRDI portal
Recommendations
Cites work
- A distinct distance set of 9 nodes in a tree of diameter 36
- Another Tree Labelling Problem
- Generalized Leech trees
- scientific article; zbMATH DE number 2186482 (Why is no real title available?)
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- Minimal distinct distance trees
- Modular Leech trees of order at most 8
- Note on Leech-type questions of trees
- Odd Path Sums in an Edge-Labeled Tree
Cited in
(8)- Note on Leech-type questions of trees
- scientific article; zbMATH DE number 2186482 (Why is no real title available?)
- Generalized Leech trees
- Modular Leech trees of order at most 8
- Two extensions of Leech labeling to the class of all graphs
- Leech graphs
- On Leech labelings of graphs and some related concepts
- A graph labeling problem
This page was built for publication: Two classes of non-Leech trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957983)