THE MINIMALITY OF THE GEORGES-KELMANS GRAPH | 0 | 0.34 | 2022 |
Patches with short boundaries. | 0 | 0.34 | 2019 |
Types of triangle in Hamiltonian triangulations and an application to domination and -walks. | 0 | 0.34 | 2019 |
Grinberg's Criterion. | 0 | 0.34 | 2019 |
Polyhedra with few 3-cuts are hamiltonian. | 0 | 0.34 | 2019 |
Generation of Union-Closed Sets and Moore Families | 0 | 0.34 | 2018 |
On the number of hamiltonian cycles in triangulations with few separating triangles | 1 | 0.35 | 2018 |
On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations | 2 | 0.43 | 2016 |
Snarks with total chromatic number 5. | 5 | 0.53 | 2015 |
Construction of planar 4-connected triangulations | 1 | 0.41 | 2015 |
An independent set approach for the communication network of the GPS III system | 1 | 0.36 | 2013 |
Generation and properties of snarks. | 33 | 1.89 | 2013 |
Generating regular directed graphs. | 0 | 0.34 | 2013 |
Generation of various classes of trivalent graphs | 5 | 0.51 | 2013 |
House of Graphs: a database of interesting graphs | 13 | 1.11 | 2013 |
A Database of Interesting Graphs: The House of Graphs. | 0 | 0.34 | 2012 |
Ramsey numbers R(K3,G) for graphs of order 10 | 3 | 0.45 | 2012 |
Snarks with Total Chromatic Number 5. | 3 | 0.41 | 2012 |
The Generation of Fullerenes. | 12 | 1.22 | 2012 |
α-Labelings and the Structure of Trees with Nonzero α-Deficit. | 1 | 0.39 | 2012 |
Generation of Cubic graphs. | 4 | 0.56 | 2011 |
Classification and generation of nanocones | 2 | 0.43 | 2011 |
Graph structural properties of non-Yutsis graphs allowing fast recognition | 1 | 0.40 | 2009 |
NANOCONES - A Classification Result in Chemistry | 0 | 0.34 | 2009 |
Rehabilitation of an unloved child: semi-splaying | 1 | 0.35 | 2009 |
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number | 8 | 0.74 | 2008 |
GrInvIn for graph theory teaching and research | 0 | 0.34 | 2007 |
Chromatic-index-critical graphs of orders 13 and 14 | 7 | 0.66 | 2005 |
Generation of simple quadrangulations of the sphere | 10 | 1.26 | 2005 |
Construction of planar triangulations with minimum degree 5 | 12 | 1.18 | 2005 |
To be or not to be Yutsis: Algorithms for the decision problem | 2 | 0.51 | 2005 |
A Catalogue of Isomerization Transformations of Fullerene Polyhedra. | 0 | 0.34 | 2003 |
A Catalogue of Growth Transformations of Fullerene Polyhedra. | 4 | 0.49 | 2003 |
The construction of cubic and quartic planar maps with prescribed face degrees | 2 | 0.43 | 2003 |
Pentagon--hexagon-patches with short boundaries | 14 | 2.08 | 2003 |
A survey and new results on computer enumeration of polyhex and fusene hydrocarbons. | 6 | 1.25 | 2003 |
Resonance graphs of catacondensed even ring systems are median | 16 | 0.99 | 2002 |
A constructive enumeration of fusenes and benzenoids | 5 | 0.90 | 2002 |
A constructive enumeration of nanotube caps | 8 | 1.38 | 2002 |
Posets on up to 16 Points | 20 | 1.47 | 2002 |
Numbers of faces and boundary encodings of patches | 3 | 1.66 | 2001 |
Counting symmetric configurations v3 | 14 | 2.09 | 2000 |
Lists of Face-Regular Polyhedra. | 2 | 0.52 | 2000 |
The Generation of Maximal Triangle-Free Graphs | 3 | 0.53 | 2000 |
Fast generation of nanotube caps | 0 | 0.34 | 1999 |
Fast generation of some classes of planar graphs | 1 | 0.39 | 1999 |
Patches with minimal boundary length | 0 | 0.34 | 1999 |
All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8 | 0 | 0.34 | 1998 |
Isomorphism rejection in structure generation programs. | 8 | 0.86 | 1998 |
Spiral Coding of Leapfrog Polyhedra | 1 | 0.86 | 1998 |