Optimal identification of sets of edges using 2-factors (Q389983): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2013.04.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037168994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Regular Graphs of Girth Six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum sizes of identifying codes in graphs differing by one vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes in Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs without three‐cycles or four‐cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4860774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of codes identifying sets of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On codes identifying sets of vertices in Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of optimal identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cages admitting identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing codes identifying sets of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank
 
Normal rank

Latest revision as of 06:00, 7 July 2024

scientific article
Language Label Description Also known as
English
Optimal identification of sets of edges using 2-factors
scientific article

    Statements

    Identifiers