The Algorithmic Complexity of k-Domatic Partition of Graphs (Q2915174)

From MaRDI portal
Revision as of 20:12, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The Algorithmic Complexity of k-Domatic Partition of Graphs
scientific article

    Statements

    title
    The Algorithmic Complexity of k-Domatic Partition of Graphs (English)
    0 references
    author
    Hongyu Liang
    0 references
    publication date
    21 September 2012
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C69
    0 references
    05C70
    0 references
    05C85
    0 references
    zbMATH DE Number
    6085044
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2915174&oldid=15883953"
    Powered by MediaWiki