F. Göbel

According to our database1, F. Göbel authored at least 11 papers between 1979 and 2000.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2000
Cyclic Graphs.
Discrete Applied Mathematics, 2000

1999
Magic Labelings of Graphs.
Ars Comb., 1999

1997
Spanning trees with pairwise nonadjacent endvertices.
Discrete Mathematics, 1997

1995
Bipartite regular graphs with fixed diameter.
Networks, 1995

1993
Generating all 3-connected 4-regular planar graphs from the octahedron graph.
Journal of Graph Theory, 1993

Coloring a graph optimally with two colors.
Discrete Mathematics, 1993

1991
Label-connected graphs and the gossip problem.
Discrete Mathematics, 1991

1986
Even graphs.
Journal of Graph Theory, 1986

1980
On a 1-1-correspondence between rooted trees and natural numbers.
J. Comb. Theory, Ser. B, 1980

1979
On an Optimality Property of Ternary Trees
Information and Control, July, 1979

On a conjecture of Tutte concerning minimal tree numbers.
J. Comb. Theory, Ser. B, 1979


  Loading...