Construction of planar triangulations with minimum degree 5
Authors:
- G. BrinkmannGBG. Brinkmann
- Brendan D. McKayBMBrendan D. McKay
- 1 October 2005
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 301 (2-3) , 147-163
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Counting 5‐connected planar triangulationsJournal of Graph Theory, 2001
- Nonhamiltonian 3-Connected Cubic Planar GraphsSIAM Journal on Discrete Mathematics, 2000
- Isomorph-Free Exhaustive GenerationJournal of Algorithms, 1998
- A Constructive Enumeration of FullerenesJournal of Algorithms, 1997
- Polyhedra of Small Order and Their Hamiltonian PropertiesJournal of Combinatorial Theory, Series B, 1996
- A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected GraphsCanadian Journal of Mathematics, 1974
- On generating planar graphsDiscrete Mathematics, 1974