Open Access
- 26 February 2015
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (2) , 407-425
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- The Generation of FullerenesJournal of Chemical Information and Modeling, 2012
- Connectivity augmentation in planar straight line graphsEuropean Journal of Combinatorics, 2012
- Augmenting the Connectivity of Planar and Geometric GraphsJournal of Graph Algorithms and Applications, 2012
- Augmenting the Edge Connectivity of Planar Straight Line Graphs to ThreeAlgorithmica, 2011
- Testing bipartiteness of geometric intersection graphsACM Transactions on Algorithms, 2009
- Augmenting the connectivity of geometric graphsComputational Geometry, 2008
- Geometric Thickness of Complete GraphsJournal of Graph Algorithms and Applications, 2000
- On representations of some thickness-two graphsComputational Geometry, 1999
- Biplanar Graphs:Computers & Mathematics with Applications, 1997
- On generating planar graphsDiscrete Mathematics, 1974