Pages that link to "Item:Q2430979"
From MaRDI portal
The following pages link to Extremal graphs for the identifying code problem (Q2430979):
Displaying 44 items.
- A comparison of approaches for finding minimum identifying codes on graphs (Q296102) (← links)
- Some links between identifying codes and separating, dominating and total dominating sets in graphs (Q324774) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- The minimum identifying code graphs (Q423972) (← links)
- Bounds for identifying codes in terms of degree parameters (Q426794) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Maximum size of a minimum watching system and the graphs achieving the bound (Q496659) (← links)
- Information retrieval and the average number of input clues (Q514538) (← links)
- On an extremal hypergraph problem related to combinatorial batch codes (Q741768) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121) (← links)
- On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Minimal identifying codes in trees and planar graphs with large girth (Q976158) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Construction of codes identifying sets of vertices (Q1773205) (← links)
- Identifying vertex covers in graphs (Q1953340) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Strong identification codes for graphs (Q2037550) (← links)
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
- The compared costs of domination location-domination and identification (Q2282469) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- Identifying codes on directed de Bruijn graphs (Q2416416) (← links)
- Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997) (← links)
- On cages admitting identifying codes (Q2426452) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- Edge identifying codes (Q2857369) (← links)
- Identifying codes and watching systems in Kneser graphs (Q2966507) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- (Q5135780) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- (Q5878174) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
- On three domination-based identification problems in block graphs (Q6614535) (← links)
