Optimal identification of sets of edges using 2-factors
From MaRDI portal
Publication:389983
DOI10.1016/j.disc.2013.04.015zbMath1281.05116OpenAlexW2037168994MaRDI QIDQ389983
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Constructing codes identifying sets of vertices
- Graph factors and factorization: 1985--2003: a survey
- Construction of codes identifying sets of vertices
- Minimum sizes of identifying codes in graphs differing by one vertex
- On cages admitting identifying codes
- Extremal graphs without three‐cycles or four‐cycles
- Sequences of optimal identifying codes
- Identifying Codes in Line Graphs
- On Hamiltonian Regular Graphs of Girth Six
- On codes identifying sets of vertices in Hamming spaces
This page was built for publication: Optimal identification of sets of edges using 2-factors