Metric dimension of maximal outerplanar graphs
From MaRDI portal
Publication:2045286
DOI10.1007/s40840-020-01068-6zbMath1478.05038arXiv1903.11933MaRDI QIDQ2045286
Gregorio Hernández, Mercè Claverol, Mercè Mora, Carmen Hernando, F. Javier Tejel, Alfredo Daniel Garcia, Montserrat Maureso
Publication date: 12 August 2021
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.11933
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C12: Distance in graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the metric dimension of wheel related graphs
- On the metric dimension of circulant and Harary graphs
- The difference between the metric dimension and the determining number of a graph
- Complexity of metric dimension on planar graphs
- The (weighted) metric dimension of graphs: hard and easy cases
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- A linear-time algorithm for drawing a planar graph on a grid
- A linear algorithm for embedding planar graphs using PQ-trees
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Resolvability in graphs and the metric dimension of a graph
- Computing the \(k\)-metric dimension of graphs
- On the metric dimension of infinite graphs
- Resolving sets and semi-resolving sets in finite projective planes
- Resolving dominating partitions in graphs
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices
- Computing the metric dimension for chain graphs
- Extremal graph theory for metric dimension and diameter
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Landmarks in graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension
- A characterization of some graphs with metric dimension two
