Boolean approach to planar embeddings of a graph (Q4271303): 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: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linearity of testing planarity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3283487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank

Latest revision as of 11:52, 22 May 2024

scientific article; zbMATH DE number 464618
Language Label Description Also known as
English
Boolean approach to planar embeddings of a graph
scientific article; zbMATH DE number 464618

    Statements

    Boolean approach to planar embeddings of a graph (English)
    0 references
    0 references
    0 references
    1 December 1993
    0 references
    0 references
    planarity
    0 references
    spanning tree
    0 references
    planar embeddings
    0 references
    Hamiltonian planar graph
    0 references
    components
    0 references