An Efficient Test for Circular-Arc Graphs (Q3900112)

From MaRDI portal
Revision as of 03:21, 4 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60307435, #quickstatements; #temporary_batch_1714786519576)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Efficient Test for Circular-Arc Graphs
scientific article

    Statements

    title
    An Efficient Test for Circular-Arc Graphs (English)
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    intersection graphs
    0 references
    circular-arc graph
    0 references
    circular arc's property
    0 references
    consecutive arc's property
    0 references
    algorithms
    0 references
    author
    Alan C. Tucker
    0 references

    Identifiers

    DOI
    10.1137/0209001
    0 references
    Mathematics Subject Classification ID
    05C75
    0 references
    68W99
    0 references
    68Q25
    0 references
    68R10
    0 references
    zbMATH DE Number
    3708462
    0 references
    OpenAlex ID
    W1980392938
    0 references
    Wikidata QID
    Q60307435
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3900112&oldid=34066089"
    Powered by MediaWiki