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

Search the dblp DataBase

Title:
Author:
Jason I. Brown: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jason I. Brown, Carl A. Hickman
    On chromatic roots with negative real part. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:63, n:, pp:- [Journal]
  2. Jason I. Brown, Richard J. Nowakowski
    Bounding the Roots of Independence Polynomials. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  3. Jason I. Brown
    The Complexity of Generalized Graph Colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:3, pp:257-270 [Journal]
  4. Jason I. Brown, Carl A. Hickman
    On chromatic roots of large subdivisions of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:17-30 [Journal]
  5. Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
    The k-fractal of a simplicial complex. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:33-45 [Journal]
  6. Jason I. Brown, Richard J. Nowakowski
    The well-covered dimension of random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:352-355 [Journal]
  7. Jason I. Brown
    On the Roots of Chromatic Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:2, pp:251-256 [Journal]
  8. Jason I. Brown
    Subdivisions and Chromatic Roots. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:76, n:2, pp:201-204 [Journal]
  9. Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
    The independence fractal of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:209-230 [Journal]
  10. Jason I. Brown, Carl A. Hickman, Alan D. Sokal, David G. Wagner
    On the Chromatic Roots of Generalized Theta Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:272-297 [Journal]
  11. Jason I. Brown, Richard J. Nowakowski
    Average independence polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:313-318 [Journal]
  12. Jason I. Brown, Vojtech Rödl
    A ramsey type problem concerning vertex colourings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:45-52 [Journal]
  13. Jason I. Brown, Xiaohu Li
    The strongly connected reliability of complete digraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:3, pp:165-168 [Journal]
  14. Jason I. Brown, Charles J. Colbourn
    A Set System Polynomial with Colouring and Reliability Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:2, pp:151-157 [Journal]
  15. Jason I. Brown, Charles J. Colbourn
    Roots of the Reliability Polynomial. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:571-585 [Journal]
  16. Jason I. Brown, Charles J. Colbourn, David G. Wagner
    Cohen-Macaulay Rings in Network Reliability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:3, pp:377-392 [Journal]
  17. Jason I. Brown, Richard J. Nowakowski
    Well-Covered Vector Spaces of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:952-965 [Journal]
  18. Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall
    The Ultimate Categorical Independence Ratio of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:290-300 [Journal]
  19. Jason I. Brown, David Kelly, J. Schönheim, Robert E. Woodrow
    Graph coloring satisfying restraints. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:2, pp:123-143 [Journal]
  20. Jason I. Brown
    Chromatic polynomials and order ideals of monomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:189, n:1-3, pp:43-68 [Journal]
  21. Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy
    The existence of uniquely -G colourable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:179, n:1-3, pp:1-11 [Journal]
  22. Jason I. Brown, Derek G. Corneil
    Graph properties and hypergraph colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:2, pp:81-93 [Journal]
  23. Jason I. Brown
    A vertex critical graph without critical edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:1, pp:99-101 [Journal]
  24. Jason I. Brown, Stephen Watson
    Mutually complementary partial orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:113, n:1-3, pp:27-39 [Journal]
  25. Jason I. Brown, Stephen Watson
    The number of complements of a topology on n points is at least 2n (except for some special cases). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:154, n:1-3, pp:27-39 [Journal]
  26. Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich
    The structure of well-covered graphs with no cycles of length 4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:17-18, pp:2235-2245 [Journal]

  27. Monomial bases for broken circuit complexes. [Citation Graph (, )][DBLP]


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