Domatic partitions of computable graphs (Q2436619)

From MaRDI portal
Revision as of 10:14, 7 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
Domatic partitions of computable graphs
scientific article

    Statements

    title
    Domatic partitions of computable graphs (English)
    0 references
    author
    Matthew Jura
    0 references
    Oscar Levin
    0 references
    Tyler Markkanen
    0 references
    publication date
    25 February 2014
    0 references
    zbMATH Keywords
    computability theory
    0 references
    computable graph theory
    0 references
    domatic number
    0 references
    dominating set
    0 references
    reverse mathematics
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03D45
    0 references
    03B30
    0 references
    03F35
    0 references
    05C63
    0 references
    05C69
    0 references
    zbMATH DE Number
    6261652
    0 references
    OpenAlex ID
    W2011539887
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2436619&oldid=35375087"
    Powered by MediaWiki