The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Edy Tri Baskoro: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Baca, Edy Tri Baskoro, Mirka Miller
    Antimagic Valuations for the Special Class of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:58-64 [Conf]
  2. Yus Mochamad Cholily, Edy Tri Baskoro, Saladin Uttunggadewa
    Some Conditions for the Existence of ( d, k)-Digraphs. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:87-93 [Conf]
  3. Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma
    An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:181-184 [Conf]
  4. Edy Tri Baskoro, Mirka Miller, Ján Plesník
    Further results on almost Moore digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  5. Edy Tri Baskoro, Surahmat
    The Ramsey number of paths with respect to wheels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:294, n:3, pp:275-277 [Journal]
  6. Surahmat, Edy Tri Baskoro, Ioan Tomescu
    The Ramsey numbers of large cycles versus wheels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:24, pp:3334-3337 [Journal]
  7. Edy Tri Baskoro, Hasmawati, H. Assiyatun
    The Ramsey numbers for disjoint unions of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:24, pp:3297-3301 [Journal]
  8. Edy Tri Baskoro, Surahmat, S. M. Nababan, Mirka Miller
    On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:4, pp:717-721 [Journal]
  9. A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro
    Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:675-681 [Journal]
  10. Edy Tri Baskoro, Mirka Miller, Jozef Sirán, Martin Sutton
    Complete characterization of almost Moore digraphs of degree three. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:112-126 [Journal]

  11. Enumerations of vertex orders of almost Moore digraphs with selfrepeats. [Citation Graph (, )][DBLP]


  12. The Ramsey numbers for disjoint unions of graphs. [Citation Graph (, )][DBLP]


  13. On the total vertex irregularity strength of trees. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002