Name
Affiliation
Papers
GUNNAR BRINKMANN
Univ Bielefeld, Fak Math, D-33501 Bielefeld, Germany
59
Collaborators
Citations 
PageRank 
73
335
54.69
Referers 
Referees 
References 
418
286
249
Search Limit
100418
Title
Citations
PageRank
Year
THE MINIMALITY OF THE GEORGES-KELMANS GRAPH00.342022
Patches with short boundaries.00.342019
Types of triangle in Hamiltonian triangulations and an application to domination and -walks.00.342019
Grinberg's Criterion.00.342019
Polyhedra with few 3-cuts are hamiltonian.00.342019
Generation of Union-Closed Sets and Moore Families00.342018
On the number of hamiltonian cycles in triangulations with few separating triangles10.352018
On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations20.432016
Snarks with total chromatic number 5.50.532015
Construction of planar 4-connected triangulations10.412015
An independent set approach for the communication network of the GPS III system10.362013
Generation and properties of snarks.331.892013
Generating regular directed graphs.00.342013
Generation of various classes of trivalent graphs50.512013
House of Graphs: a database of interesting graphs131.112013
A Database of Interesting Graphs: The House of Graphs.00.342012
Ramsey numbers R(K3,G) for graphs of order 1030.452012
Snarks with Total Chromatic Number 5.30.412012
The Generation of Fullerenes.121.222012
α-Labelings and the Structure of Trees with Nonzero α-Deficit.10.392012
Generation of Cubic graphs.40.562011
Classification and generation of nanocones20.432011
Graph structural properties of non-Yutsis graphs allowing fast recognition10.402009
NANOCONES - A Classification Result in Chemistry00.342009
Rehabilitation of an unloved child: semi-splaying10.352009
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number80.742008
GrInvIn for graph theory teaching and research00.342007
Chromatic-index-critical graphs of orders 13 and 1470.662005
Generation of simple quadrangulations of the sphere101.262005
Construction of planar triangulations with minimum degree 5121.182005
To be or not to be Yutsis: Algorithms for the decision problem20.512005
A Catalogue of Isomerization Transformations of Fullerene Polyhedra.00.342003
A Catalogue of Growth Transformations of Fullerene Polyhedra.40.492003
The construction of cubic and quartic planar maps with prescribed face degrees20.432003
Pentagon--hexagon-patches with short boundaries142.082003
A survey and new results on computer enumeration of polyhex and fusene hydrocarbons.61.252003
Resonance graphs of catacondensed even ring systems are median160.992002
A constructive enumeration of fusenes and benzenoids50.902002
A constructive enumeration of nanotube caps81.382002
Posets on up to 16 Points201.472002
Numbers of faces and boundary encodings of patches31.662001
Counting symmetric configurations v3142.092000
Lists of Face-Regular Polyhedra.20.522000
The Generation of Maximal Triangle-Free Graphs30.532000
Fast generation of nanotube caps00.341999
Fast generation of some classes of planar graphs10.391999
Patches with minimal boundary length00.341999
All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 800.341998
Isomorphism rejection in structure generation programs.80.861998
Spiral Coding of Leapfrog Polyhedra10.861998
  • 1
  • 2