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 17 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)
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
- Extremal cubic graphs for fault-tolerant locating domination (Q2143147) (← links)
- The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← 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)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- The open-locating-dominating number of some convex polytopes (Q5014387) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)
- On three domination-based identification problems in block graphs (Q6132542) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)