Minimal identifying codes in trees and planar graphs with large girth (Q976158)

From MaRDI portal
Revision as of 22:57, 2 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
Minimal identifying codes in trees and planar graphs with large girth
scientific article

    Statements

    title
    Minimal identifying codes in trees and planar graphs with large girth (English)
    0 references
    author
    David Auger
    0 references
    publication date
    17 June 2010
    0 references
    zbMATH Keywords
    finite undirected graph
    0 references

    Identifiers

    zbMATH DE Number
    5722044
    0 references
    OpenAlex ID
    W1965065197
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q976158&oldid=35174785"
    Powered by MediaWiki