Pages that link to "Item:Q324734"
From MaRDI portal
The following pages link to A polyhedral approach to locating-dominating sets in graphs (Q324734):
Displaying 12 items.
- On locating-dominating set of regular graphs (Q2052122) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- A note on the complexity of locating-total domination in graphs (Q2333807) (← links)
- Locating-dominating sets of functigraphs (Q2333813) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
- (Q4281505) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- An extension of locating-total domination problem and its complexity (Q6652677) (← links)