On Boolean characterizations of planarity and planar embeddings of graphs
From MaRDI portal
Publication:2276969
Recommendations
Cites work
- scientific article; zbMATH DE number 3116364 (Why is no real title available?)
- scientific article; zbMATH DE number 3165199 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3024665 (Why is no real title available?)
- A Depth-First-Search Characterization of Planarity
- A new approach to the linearity of testing planarity of graphs
- A structural characterization of planar combinatorial graphs
- Efficient Planarity Testing
- Non-Separable and Planar Graphs
- On the linearity of testing planarity of graphs
- Planar Graphs
- Preuve Algebrique Du Critere De Planarite De Wu-Liu
- Toward a theory of crossing numbers
Cited in
(6)- Boolean approaches to graph embeddings related to VLSI
- Another characterisation of planar graphs
- scientific article; zbMATH DE number 431506 (Why is no real title available?)
- Boolean approach to planar embeddings of a graph
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Boolean planarity characterization of graphs
This page was built for publication: On Boolean characterizations of planarity and planar embeddings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276969)