Counting Hexagonal Patches and Independent Sets in Circle Graphs (Q3557053)

From MaRDI portal
Revision as of 01:50, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Counting Hexagonal Patches and Independent Sets in Circle Graphs
scientific article

    Statements

    Counting Hexagonal Patches and Independent Sets in Circle Graphs (English)
    0 references
    0 references
    0 references
    27 April 2010
    0 references
    graph algorithms
    0 references
    computational complexity
    0 references
    counting problem
    0 references
    planar graph
    0 references
    circle graph
    0 references
    fullerene
    0 references
    hexagonal patch
    0 references
    fusene
    0 references
    polyhex
    0 references

    Identifiers