arXiv (All)
open access
Metric Dimension is NP-complete on Graphs of Treewidth Two
The metric dimension of a connected graph is the least number of vertices whose distance vectors distinguish all vertices. We show that deciding whether the metric dimension of a graph is at most a given integer is NP-complete on graphs of treewidth at most two. As the problem is polynomial on trees
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Recursive Paintboxes and the Martin Boundary of the Hoffman Rooted-Tree Graph#1078206
- Visualizing Treewidth#798636
- Visualizing Treewidth#797223
- The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs#1154714
- Dynamic Edge Coloring of Forests#785160
Record · ID 1356469
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive