Optimal identification of sets of edges using 2-factors
From MaRDI portal
Publication:389983
DOI10.1016/J.DISC.2013.04.015zbMATH Open1281.05116OpenAlexW2037168994MaRDI QIDQ389983FDOQ389983
Publication date: 22 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.04.015
Recommendations
- Nearly optimal edge estimation with independent set queries
- An optimal lower bound on the number of variables for graph identification
- A probabilistic upper bound for the edge identification complexity of graphs
- Adaptive identification of sets of vertices in graphs
- scientific article
- Optimizing regular edge labelings
- Uniquely identifying the edges of a graph: the edge metric dimension
- Edge Estimation with Independent Set Oracles
- Edge estimation with independent set oracles
- Distance-based vertex identification in graphs: the outer multiset dimension
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Identifying Codes in Line Graphs
- Minimum sizes of identifying codes in graphs differing by one vertex
- Graph factors and factorization: 1985--2003: a survey
- Construction of codes identifying sets of vertices
- On cages admitting identifying codes
- Extremal graphs without three‐cycles or four‐cycles
- Title not available (Why is that?)
- Sequences of optimal identifying codes
- On Hamiltonian Regular Graphs of Girth Six
- On codes identifying sets of vertices in Hamming spaces
- Constructing codes identifying sets of vertices
Cited In (2)
This page was built for publication: Optimal identification of sets of edges using 2-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389983)
