Identifying codes in triangle-free graphs of bounded maximum degree
From MaRDI portal
Cites work
- Alternative parameterizations of \textsc{Metric Dimension}
- Another algebraic proof of Bondy's theorem on induced subsets
- Bounds for identifying codes in terms of degree parameters
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
- Domination in digraphs
- Domination in Graphs: Core Concepts
- Extremal graphs for the identifying code problem
- How complex are random graphs in first order logic?
- scientific article; zbMATH DE number 3161569 (Why is no real title available?)
- scientific article; zbMATH DE number 3869331 (Why is no real title available?)
- scientific article; zbMATH DE number 3906528 (Why is no real title available?)
- ID codes in Cartesian products of cliques
- Identifying and locating-dominating codes on chains and cycles
- Identifying codes in bipartite graphs of given maximum degree
- Identifying codes in graphs of given maximum degree: characterizing trees
- Identifying codes in line graphs
- Identifying codes of cycles
- Identifying codes of the direct product of two cliques
- Induced subsets
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Locating-domination and identification
- Models of domination in graphs
- New results on variants of covering codes in Sierpiński graphs
- On a conjecture regarding identification in Hamming graphs
- On a new class of codes for identifying vertices in graphs
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- On the size of identifying codes in triangle-free graphs
- Paths, Stars and the Number Three
- Revisiting and improving upper bounds for identifying codes
This page was built for publication: Identifying codes in triangle-free graphs of bounded maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262424)
