The SCEAS System
Navigation Menu

Search the dblp DataBase


F. Göbel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. F. Göbel, Cornelis Hoede
    Magic Labelings of Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:51, n:, pp:- [Journal]
  2. F. Göbel, E. A. Neutel
    Cyclic Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:3-12 [Journal]
  3. F. Göbel, Cornelis Hoede
    On an Optimality Property of Ternary Trees [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:42, n:1, pp:10-26 [Journal]
  4. F. Göbel
    On a 1-1-correspondence between rooted trees and natural numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:29, n:1, pp:141-143 [Journal]
  5. F. Göbel, A. A. Jagers
    On a conjecture of Tutte concerning minimal tree numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:3, pp:346-348 [Journal]
  6. Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
    Spanning trees with pairwise nonadjacent endvertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:219-222 [Journal]
  7. F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman
    Label-connected graphs and the gossip problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:1, pp:29-40 [Journal]
  8. H. J. Broersma, F. Göbel
    Coloring a graph optimally with two colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:23-31 [Journal]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002