Pages that link to "Item:Q512651"

The following pages link to Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651):

Displaying 13 items.

• Centroidal localization game (Q668034) (← links)
• Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
• Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
• Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs (Q2091788) (← links)
• Truncated metric dimension for finite graphs (Q2166223) (← links)
• Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
• Vertex identification in trees (Q5051441) (← links)
• Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
• Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
• Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)