The monadic second-order logic of graphs. XII: Planar graphs and planar maps
From MaRDI portal
Publication:1566702
DOI10.1016/S0304-3975(99)00305-9zbMath0951.03004MaRDI QIDQ1566702
No author found.
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
monadic second-order logicplanar graphgraph drawing3-connected graphdepth-first search treeordered structurerotation systemextension of first-order logic
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Trees, grids, and MSO decidability: from graphs to matroids ⋮ Computing crossing numbers in quadratic time ⋮ Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees ⋮ A monadic second-order definition of the structure of convex hypergraphs. ⋮ Unnamed Item ⋮ Circle graphs and monadic second-order logic ⋮ GETGRATS ⋮ The Common Structure of the Curves Having a Same Gauss Word ⋮ The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monadic second-order evaluations on tree-decomposable graphs
- Monadic second-order definable graph transductions: a survey
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- The monadic second-order logic of graphs. X: Linear orderings
- The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
- The monadic second-order logic of graphs. VIII: Orientations
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
- Easy problems for tree-decomposable graphs
This page was built for publication: The monadic second-order logic of graphs. XII: Planar graphs and planar maps
