Pages that link to "Item:Q1752479"
From MaRDI portal
The following pages link to Polyhedra associated with identifying codes in graphs (Q1752479):
Displaying 9 items.
- Codes associated with generalized polygons (Q1109752) (← links)
- Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← 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 linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- (Q4325118) (← links)
- On three domination-based identification problems in block graphs (Q6614535) (← links)