F. Göbel

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2000 J jnl
Cyclic Graphs.
Discret. Appl. Math.
F. Göbel, E. A. Neutel
1999 J jnl
Magic Labelings of Graphs.
Ars Comb.
F. Göbel, Cornelis Hoede
1997 J jnl
Spanning trees with pairwise nonadjacent endvertices.
Discret. Math.
Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
1995 J jnl
Bipartite regular graphs with fixed diameter.
Networks
Haitze J. Broersma, F. Göbel
1993 J jnl
Coloring a graph optimally with two colors.
Discret. Math.
Haitze J. Broersma, F. Göbel
1993 J jnl
Generating all 3-connected 4-regular planar graphs from the octahedron graph.
J. Graph Theory
Haitze J. Broersma, A. J. W. Duijvestijn, F. Göbel
1991 J jnl
Label-connected graphs and the gossip problem.
Discret. Math.
F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman
1986 J jnl
Even graphs.
J. Graph Theory
F. Göbel, Henk Jan Veldman
1980 J jnl
On a 1-1-correspondence between rooted trees and natural numbers.
J. Comb. Theory B
F. Göbel
1979 J jnl
On a conjecture of Tutte concerning minimal tree numbers.
J. Comb. Theory B
F. Göbel, A. A. Jagers
1979 J jnl
On an Optimality Property of Ternary Trees
Inf. Control.
F. Göbel, Cornelis Hoede