|
Search the dblp DataBase
David M. Berman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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
|