Automated Deduction in Geometry

DOI10.1007/B95516zbMATH Open1202.68455OpenAlexW2489376520MaRDI QIDQ5902027FDOQ5902027

Authors: J. C. Owen, S. C. Power 

Publication date: 4 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95516

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

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Planar graphs; geometric and topological aspects of graph theory (05C10)

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)