On counting planar embeddings (Q1313885): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural characterization of planar combinatorial graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank

Latest revision as of 11:58, 22 May 2024

scientific article
Language Label Description Also known as
English
On counting planar embeddings
scientific article

    Statements

    On counting planar embeddings (English)
    0 references
    10 March 1994
    0 references
    counting
    0 references
    embeddings
    0 references
    planar graph
    0 references
    embedding tree
    0 references

    Identifiers