Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346)

From MaRDI portal
Revision as of 22:05, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/dam/BrimkovJKKPRST18, #quickstatements; #temporary_batch_1731530891435)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Homothetic polygons and beyond: maximal cliques in intersection graphs
scientific article

    Statements

    title
    Homothetic polygons and beyond: maximal cliques in intersection graphs (English)
    0 references
    author
    Valentin E. Brimkov
    0 references
    Sean Kafer
    0 references
    Jan Kratochvíl
    0 references
    Martin Pergel
    0 references
    Paweł Rzążewski
    0 references
    Joshua Terhaar
    0 references
    publication date
    6 September 2018
    0 references
    zbMATH Keywords
    geometric intersection graphs
    0 references
    \(P_{h o m}\) graphs
    0 references
    maximal clique
    0 references
    cites work
    Q3514515
    0 references
    On a Coloring Problem.
    0 references
    Q3145799
    0 references
    Unit disk graphs
    0 references
    Q4828541
    0 references
    Q4657585
    0 references
    Q3348944
    0 references
    On cliques in graphs
    0 references
    Q4871056
    0 references
    Q5588433
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C76
    0 references
    05C69
    0 references
    05C35
    0 references
    zbMATH DE Number
    6933519
    0 references
    OpenAlex ID
    W2796591137
    0 references
    Wikidata QID
    Q62595887
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1671346&oldid=37910010"
    Powered by MediaWiki