Pages that link to "Item:Q5268001"
From MaRDI portal
The following pages link to Metric Dimension of Bounded Tree-length Graphs (Q5268001):
Displayed 17 items.
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Metric properties of generalized Sierpiński graphs over stars (Q2026318) (← links)
- Metric dimension parameterized by treewidth (Q2041987) (← links)
- Local metric dimension for graphs with small clique numbers (Q2075516) (← links)
- Hardness of metric dimension in graphs of constant treewidth (Q2093561) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- Parameterized Complexity of Geodetic Set (Q5050005) (← links)
- Sequential metric dimension (Q5918179) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
- Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters (Q6072291) (← links)
- Parameterized Complexity of Geodetic Set (Q6089667) (← links)
- Pathlength of outerplanar graphs (Q6109003) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)