The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings (Q1575704): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Maps, hypermaps and their automorphisms: A survey. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order definable graph transductions: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. XII: Planar graphs and planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying spatial databases via topological invariants / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(00)00180-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972604043 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
scientific article

    Statements

    The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings (English)
    0 references
    0 references
    21 August 2000
    0 references
    planar graph
    0 references
    combinatorial map
    0 references
    graph drawing
    0 references
    monadic second-order logic
    0 references
    edge crossing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references