The SCEAS System
Navigation Menu

Journals in DBLP

Ars Comb.
2001, volume: 58, number:

  1. 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]
  2. Peter Che Bor Lam, Wai Chee Shiu, Feng Sun, Jianfang Wang, Guiying Yan
    Linear Vertex Arboricity, Independence Number and Clique Cover Number. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  3. Antoaneta Klobucar
    K-dominating sets of P[2k+2]xP[n] and P[m]xP[n]. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  4. Toru Kojima, Kiyoshi Ando
    Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  5. Jianping Li, Ruqun Shen, Feng Tian
    Cycles Containing Given Subsets in 1-Tough Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  6. Siaw-Lynn Ng, Peter R. Wild
    On k-arcs Covering a Line in Finite Projective Planes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  7. Ignacio M. Pelayo, Camino Balbuena, J. Gómez
    On the connectivity of generalized p-cycles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  8. William Pensaert
    Minimum Average Broadcast Time in a Graph of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  9. Toshinori Sakai
    Long Paths and Cycles Through Specified Vertices in k-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  10. Riste Skrekovski
    A note on choosability with separation for planar graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  11. Lutz Volkmann
    Spanning multipartite tournaments of semicomplete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  12. Ian M. Wanless
    McLeish's construction for Latin squares without intercalates. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  13. Maria Kwasnik, Maciej Zwierzchowski
    Special Kinds of Domination Parameters of Edge-Deleted Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  14. Sanpei Kageyama, Tsutomu Shimata
    A combinatorial structure of affine (a1, ..., at)-resolvable (r, l)-designs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  15. Peter Horák, Edward Bertram, S. Mohammed
    Small 2-factors of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  16. Himmet Can, Lee Hawkins
    A Computer Program for Obtaining Subsystems. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  17. Jenifer Corp, Jennifer McNulty
    On A Characterization of Balanced Matroids. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  18. Guantao Chen, Ralph J. Faudree, Warren E. Shreve
    Weak Clique-Covering Cycles and Paths. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  19. David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart
    Multipartite Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  20. Zhang Cheng-heng
    The Lucas Matrix of Order 2k Sequence {L(2k)n). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  21. Klaus Dohmen
    A New Perspective on the Union-Closed Sets Conjecture. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  22. David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam
    Two families of graphs that are not CCE-orientable. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  23. Allen G. Fuller, Ronald J. Gould
    Path Spectra and Forbidden Families. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  24. Heather Gavlas
    A New Distance Measure between Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  25. John Ginsburg, V. Linek
    A space-filling complete graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  26. Gary Haggard, Thomas R. Mathies
    Using Thresholds to Compute Chromatic Polynomials. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  27. Lauren K. Williams
    On Exact n-Step Domination. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002