Partitioning a graph into offensive \(k\)-alliances (Q629362)

From MaRDI portal
Revision as of 17:37, 3 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57974381, #quickstatements; #temporary_batch_1706974296281)
scientific article
Language Label Description Also known as
English
Partitioning a graph into offensive \(k\)-alliances
scientific article

    Statements

    title
    Partitioning a graph into offensive \(k\)-alliances (English)
    0 references
    publication date
    9 March 2011
    0 references
    zbMATH Keywords
    offensive alliances
    0 references
    dominating sets
    0 references
    domination number
    0 references
    chromatic number
    0 references

    Identifiers

    zbMATH DE Number
    5862858
    0 references
    Wikidata QID
    Q57974381
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q629362&oldid=15712041"
    Powered by MediaWiki