The SCEAS System
Navigation Menu

Search the dblp DataBase


Thomas Dale Porter: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lane H. Clark, Thomas Dale Porter
    On the Maximum Number of Chords in a Cycle of a Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:46, n:, pp:- [Journal]
  2. Thomas Dale Porter
    Minimal Partitions of a Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:53, n:, pp:- [Journal]
  3. Thomas Dale Porter
    On a bottleneck bipartition conjecture of Erdös. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:3, pp:317-321 [Journal]
  4. Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter
    A hierarchy of self-clique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:193-208 [Journal]
  5. John P. McSorley, Thomas Dale Porter
    Generating sequences of clique-symmetric graphs via Eulerian digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:85-91 [Journal]

  6. Binomial Identities Generated by Counting Spanning Trees. [Citation Graph (, )][DBLP]

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