default search action
DIMACS Workshop: Discrete Mathematical Chemistry 1998
- Pierre Hansen, Patrick W. Fowler, Maolin Zheng:
Discrete Mathematical Chemistry, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1998. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 51, DIMACS/AMS 2000, ISBN 978-0-8218-0987-7 - Participants. Discrete Mathematical Chemistry 1998: xi-
- Contributing Authors. Discrete Mathematical Chemistry 1998: xiii-
- Foreword. Discrete Mathematical Chemistry 1998: xv-
- Preface. Discrete Mathematical Chemistry 1998: xvii-
- Dedication. Discrete Mathematical Chemistry 1998: xix-
- Hernán G. Abeledo, Gary W. Atkinson:
The Clar and Fries problems for benzenoid hydrocarbons are linear programs. 1-8 - Subhash C. Basak, Brian D. Gute:
Use of graph invariants in QMSA and predictive toxicology. 9-24 - Gunnar Brinkmann:
Isomorphism rejection in structure generation programs. 25-38 - Laimutis Bytautas, Douglas J. Klein, Milan Randic, Tomaz Pisanski:
Foldedness in linear polymers: A difference between graphical and Euclidean distances. 39-61 - Gilles Caporossi, Pierre Hansen, Maolin Zheng:
Enumeration of fusenes to h = 20. 63-78 - Dragos M. Cvetkovic:
Characterizing properties of some graph invariants related to electron charges in the Hückel molecular orbital theory. 79-84 - Olaf Delgado-Friedrichs:
Fast embeddings for planar molecular graphs. 85-95 - Olaf Delgado-Friedrichs, Marián Deza:
More icosahedral fulleroids. 97-115 - Andreas Dietz, Christophe Fiorio, Michel Habib, Claude Laurenço:
Representation of stereochemistry using combinatorial maps. 117-128 - Bo Tao Fan, Annick Panaye, Jianhua Yao, Shengang Yuan, Jean-Pierre Doucet:
Geometric symmetry and chemical equivalence. 129-138 - Patrick W. Fowler, Peter E. John, Horst Sachs:
(3-6)-cages, hexagonal toroidal cages, and their spectra. 139-174 - Patrick W. Fowler, Tomaz Pisanski, Ante Graovac, Janez Zerovnik:
A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra. 175-187 - Xiaofeng Guo, Milan Randic:
An efficient algorithm for determining fixed bonds and normal components in a bipartite graph. 189-197 - Ray Hefferlin:
Numerical solutions of the Laplace equation in chemical spaces. 199-201 - Stephen T. Hyde, Stuart Ramsden:
Chemical frameworks and hyperbolic tilings. 203-224 - Adalbert Kerber, Reinhard Laue, Thomas Wieland:
Discrete mathematics for combinatorial chemistry. 225-234 - Robert Bruce King:
Carbon networks on cubic infinite periodic minimal surfaces. 235-248 - Sandi Klavzar:
Applications of isometric embeddings to chemical graphs. 249-259 - Joseph Malkevitch:
Geometrical and combinatorial questions about fullerenes. 261-266 - Paul G. Mezey:
Topological methods of molecular shape analysis: Continuum models and discretization. 267-278 - Helgo M. Ohlenbusch, Nicolas Rivier, Tomaso Aste, Benoit Dubertret:
Random networks in two dimensions. Simulations and correlations. 279-292 - Charles M. Quinn, David B. Redmond, Patrick W. Fowler:
Group and graph theoretical perspectives on the structures of large icosahedral cages. 293-303 - Milan Randic, Xiaofeng Guo, Sol Bobst:
Use of path matrices for a characterization of molecular structures. 305-322 - Peter Rowlinson:
Star sets and star complements in finite graphs: A spectral construction technique. 323-332 - Humberto Terrones Maldonado, Mauricio Terrones Maldonado:
Geometry and energetics of high genus fullerenes and nanotubes. 333-342 - Philippe Vismara, Claude Laurenço:
An abstract representation for molecular graphs. 343-366 - Jörg M. Wills:
The Wulff-shape of large periodic sphere packings. 367-375 - Andrew V. Zeigarnik:
On hypercycles and hypercircuits in hypergraphs. 377-383 - Fuji Zhang, Huaien Li:
On maximal energy ordering of acyclic conjugated molecules. 385-392
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.