Partitioning graphs into complete and empty graphs (Q1045126)

From MaRDI portal
Revision as of 14:39, 11 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Partitioning graphs into complete and empty graphs
scientific article

    Statements

    title
    Partitioning graphs into complete and empty graphs (English)
    0 references
    author
    Tınaz Ekim
    0 references
    John G. Gimbel
    0 references
    publication date
    15 December 2009
    0 references
    zbMATH DE Number
    5648158
    0 references
    zbMATH Keywords
    (\(j,k\))-coloring
    0 references
    split graph
    0 references
    cocoloring
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1045126&oldid=1328755"
      Powered by MediaWiki