Automated Deduction in Geometry
From MaRDI portal
(Redirected from Publication:5902027)
Automated Deduction in Geometry (scientific article; zbMATH DE number 5561583)
Automated Deduction in Geometry (scientific article; zbMATH DE number 5561583)
Recommendations
- The non-solvability by radicals of generic 3-connected planar Laman graphs
- On the density of non-simple 3-planar graphs
- Nonhamiltonian 3-Connected Cubic Planar Graphs
- scientific article; zbMATH DE number 5116037
- A note on 3-connected cubic planar graphs
- Characterizing 3-connected planar graphs and graphic matroids
- A generalized Beraha conjecture for non-planar graphs
- On non-planarity of cubic graphs
- On 3-simplicial vertices in planar graphs
- On 3-choosability of planar graphs without certain cycles
Cited in
(4)- The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
- The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
- The non-solvability by radicals of generic 3-connected planar Laman graphs
- Radically solvable graphs
This page was built for publication: Automated Deduction in Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902027)