Pages that link to "Item:Q742603"
From MaRDI portal
The following pages link to Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603):
Displayed 7 items.
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)
