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

Search the dblp DataBase

Title:
Author:
Arthur M. Hobbs: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Arthur M. Hobbs, Hong-Jian Lai
    Dedication. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:1-0 [Journal]
  4. Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson
    Paul Catlin 1948-1995. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:3-12 [Journal]
  5. Arthur M. Hobbs
    Packing Sequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:36, n:2, pp:174-182 [Journal]
  6. Arthur M. Hobbs
    Maximal Hamiltonian cycles in squares of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:1, pp:35-49 [Journal]
  7. Arthur M. Hobbs
    Hamiltonian squares of cacti. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:1, pp:50-65 [Journal]
  8. Paul Erdös, Arthur M. Hobbs
    Hamiltonian cycles in regular graphs of moderate degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:1, pp:139-142 [Journal]
  9. Paul Erdös, Arthur M. Hobbs, C. Payan
    Disjoint cliques and disjoint maximal independent sets of vertices in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:1, pp:57-61 [Journal]
  10. Arthur M. Hobbs, Edward F. Schmeichel
    On the maximum number of independent edges in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:2-3, pp:317-320 [Journal]
  11. Arthur M. Hobbs, Brian A. Bourgeois, Jothi Kasiraj
    Packing trees in complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:1, pp:27-42 [Journal]

  12. Transforming a graph into a 1-balanced graph. [Citation Graph (, )][DBLP]


  13. Balanced and 1-balanced graph constructions. [Citation Graph (, )][DBLP]


  14. Hamiltonicity in vertex envelopes of plane cubic graphs. [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