Vertex identification in trees
From MaRDI portal
Recommendations
Cites work
- A kaleidoscopic view of graph colorings
- A survey of antiregular graphs
- Approximation complexity of metric dimension problem
- Color-induced graph colorings
- Extremal graph theory for metric dimension and diameter
- scientific article; zbMATH DE number 5844285 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 2068163 (Why is no real title available?)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Irregularity in graphs
- Resolvability in graphs and the metric dimension of a graph
- Structure-activity maps for visualizing the graph variables arising in drug design
- The partition dimension of a graph
Cited in
(6)- scientific article; zbMATH DE number 7622442 (Why is no real title available?)
- scientific article; zbMATH DE number 6277690 (Why is no real title available?)
- Complexity and equivalency of multiset dimension and ID-colorings
- Graph identification index
- On multiset dimension of cylindrical graphs
- Forbidden subgraphs and prohibited colorings for vertex identification in graphs
This page was built for publication: Vertex identification in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5051441)