Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
From MaRDI portal
(Redirected from Publication:742603)
Recommendations
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- scientific article; zbMATH DE number 177889
- Total transversals in hypergraphs and their applications
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Locating and identifying codes in dihedral graphs
- Families of completely transitive codes and distance transitive graphs
- Identifying codes in \(q\)-ary hypercubes
- On a new class of identifying codes in graphs
- On graphs admitting codes identifying sets of vertices
- Hypercube embeddings and Cayley graphs generated by transpositions
Cites work
- A survey of selected recent results on total domination in graphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Approximation algorithms for the test cover problem
- Covering all cliques of a graph
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Extremal graphs for the identifying code problem
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2081148 (Why is no real title available?)
- Hypergraphs with large transversal number and with edge sizes at least 3
- Identifying vertex covers in graphs
- On a new class of codes for identifying vertices in graphs
- On strongly identifying codes
- Open neighborhood locating-dominating in trees
- Small transversals in hypergraphs
- Total domination of graphs and small transversals of hypergraphs
Cited in
(22)- Characterizing extremal graphs for open neighbourhood location-domination
- Bounding the trace function of a hypergraph with applications
- Extremal cubic graphs for fault-tolerant locating domination
- The \textsc{red-blue separation} problem on graphs
- Fixed-parameter tractable algorithms for tracking shortest paths
- Set graphs. II. Complexity of set graph recognition and similar problems
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- On the size of identifying codes in triangle-free graphs
- The open-locating-dominating number of some convex polytopes
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- My favorite domination conjectures in graph theory are bounded
- On three domination-based identification problems in block graphs
- The \textsc{Red-Blue Separation} problem on graphs
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- On three domination-based identification problems in block graphs
- Fault-tolerant locating-dominating sets with error-correction
- Open-locating dominating number for flower snarks
- On open-separating dominating codes in graphs
- Error-correcting open-locating-dominating sets
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
- Fault tolerant detectors for distinguishing sets in graphs
This page was built for publication: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742603)
