Counting hexagonal patches and independent sets in circle graphs (Q2429365): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding Fullerene Patches in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagon-hexagon-patches with short boundaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive enumeration of nanotube caps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numbers of faces in disordered patches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filling of a given boundary by \(p\)-gons and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to the disk of properly nested plane immersions of the circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4827523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary uniqueness of fusenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently implementing maximum independent set algorithms on circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nature and meaning of perturbations in geometric computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting and decomposing self-overlapping curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank

Latest revision as of 03:39, 5 July 2024

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
    0 references
    26 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references