Pages that link to "Item:Q3824429"
From MaRDI portal
The following pages link to Boolean planarity characterization of graphs (Q3824429):
Displaying 7 items.
- Boolean-width of graphs (Q719257) (← links)
- On the linearity of testing planarity of graphs (Q1095918) (← links)
- Boolean approaches to graph embeddings related to VLSI (Q1609705) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Another characterisation of planar graphs (Q2380426) (← links)
- A criterion for the planarity of a graph (Q3752397) (← links)
- Boolean approach to planar embeddings of a graph (Q4271303) (← links)