The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David M. Berman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael O. Albertson, David M. Berman
    The chromatic difference sequence of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:29, n:1, pp:1-12 [Journal]
  2. Michael O. Albertson, David M. Berman
    Critical graphs for chromatic difference sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:31, n:3, pp:225-233 [Journal]
  3. David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo
    All trees contain a large induced subgraph having all degrees 1 (mod k). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:175, n:1-3, pp:35-40 [Journal]
  4. Michael O. Albertson, David M. Berman
    The number of cut-vertices in a graph of given minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:1, pp:97-100 [Journal]

Search in 0.002secs, 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