Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
From MaRDI portal
Publication:742603
DOI10.1007/s00373-013-1311-2zbMath1298.05236OpenAlexW1993023750MaRDI QIDQ742603
Michael A. Henning, Anders Yeo
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1311-2
Hypergraphs (05C65) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Extremal cubic graphs for fault-tolerant locating domination ⋮ The \textsc{red-blue separation} problem on graphs ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ 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 the size of identifying codes in triangle-free graphs ⋮ Fixed-parameter tractable algorithms for tracking shortest paths ⋮ Parameterized and approximation complexity of \textsc{Partial VC Dimension} ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. ⋮ Set graphs. II. Complexity of set graph recognition and similar problems ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ Bounding the trace function of a hypergraph with applications ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ The open-locating-dominating number of some convex polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Open neighborhood locating-dominating in trees
- Total domination of graphs and small transversals of hypergraphs
- A survey of selected recent results on total domination in graphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Approximation algorithms for the test cover problem
- On strongly identifying codes
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Identifying vertex covers in graphs
- Extremal graphs for the identifying code problem
- Hypergraphs with large transversal number and with edge sizes at least 3
- On a new class of codes for identifying vertices in graphs
This page was built for publication: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
