Identifying X-trees with few characters
From MaRDI portal
Recommendations
- A characterization of \(k\)-trees
- Bounds on the identifying codes in trees
- Identifying codes in trees and planar graphs
- Distinguishing trees in linear time
- scientific article; zbMATH DE number 823452
- Counting and coding identity trees with fixed diameter and bounded degree
- Minimal identifying codes in trees and planar graphs with large girth
- On a Characterization of Trees
- scientific article; zbMATH DE number 2147927
- Sequences Characterizing k-Trees
Cited in
(4)
This page was built for publication: Identifying \(X\)-trees with few characters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869997)