The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Paul A. Catlin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul A. Catlin
    Contractions of graphs with no spanning eulerian subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:4, pp:313-321 [Journal]
  2. Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai
    Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:3, pp:285-302 [Journal]
  3. Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai
    Graph family operations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:71-97 [Journal]
  4. Paul A. Catlin
    Graph homomorphisms into the five-cycle. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:199-211 [Journal]
  5. Paul A. Catlin, Hong-Jian Lai
    Supereulerian Graphs and the Petersen Graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:123-139 [Journal]
  6. Béla Bollobás, Paul A. Catlin
    Topological cliques of random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:2, pp:224-227 [Journal]
  7. Paul A. Catlin
    Brooks' graph-coloring theorem and the independence number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:27, n:1, pp:42-48 [Journal]
  8. Paul A. Catlin
    Hajós' graph-coloring conjecture: Variations and counterexamples. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:2, pp:268-274 [Journal]
  9. Paul A. Catlin
    Spanning eulerian subgraphs and matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:2, pp:95-116 [Journal]
  10. Paul A. Catlin, Hong-Jian Lai
    Vertex arboricity and maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:37-46 [Journal]
  11. Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai
    Graphs without spanning closed trails. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:81-91 [Journal]
  12. Paul A. Catlin
    The reduction of graph families closed under contraction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:67-80 [Journal]

  13. Edge-connectivity and edge-disjoint spanning 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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002