Minimum sizes of identifying codes in graphs differing by one edge (Q2016394)

From MaRDI portal
Revision as of 16:11, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum sizes of identifying codes in graphs differing by one edge
scientific article

    Statements

    title
    Minimum sizes of identifying codes in graphs differing by one edge (English)
    0 references
    author
    Irène Charon
    0 references
    Olivier Hudry
    0 references
    Iiro S. Honkala
    0 references
    Antoine C. Lobstein
    0 references
    publication date
    20 June 2014
    0 references
    zbMATH Keywords
    graph theory
    0 references
    twin-free graphs
    0 references
    identifiable graphs
    0 references
    identifying codes
    0 references

    Identifiers

    zbMATH DE Number
    6305765
    0 references
    OpenAlex ID
    W2073347666
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2016394&oldid=35394427"
    Powered by MediaWiki