Counting cliques in 1-planar graphs (Q2111191)

From MaRDI portal
Revision as of 10:37, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Counting cliques in 1-planar graphs
scientific article

    Statements

    title
    Counting cliques in 1-planar graphs (English)
    0 references
    author
    J. Pascal Gollin
    0 references
    Kevin Hendrey
    0 references
    Abhishek Methuku
    0 references
    Casey Tompkins
    0 references
    Xin Zhang
    0 references
    publication date
    28 December 2022
    0 references
    zbMATH Keywords
    maximum total number of cliques
    0 references
    maximum number of cliques of any fixed size
    0 references
    extremal graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C30
    0 references
    05C10
    0 references
    05C35
    0 references
    05C75
    0 references
    zbMATH DE Number
    7637350
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2111191&oldid=23805494"
    Powered by MediaWiki