The SCEAS System
Navigation Menu

Journals in DBLP

Ars Comb.
1996, volume: 42, number:

  1. Khaled A. S. Abdel-Ghaffar
    On the number of mutually orthogonal partial latin squares. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  2. Wen-Ai Jackson, Kathleen A. S. Quinn, Peter R. Wild
    Quadrics and difference sets. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  3. Mike Jacroux
    On the construction of m times n magic rectangles where m and n are both nonprime integers. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  4. R. H. Jeurissen, Th. Bezembinder
    Enumerating oriented triangle graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  5. Jonathan Keene, Andrew Simoson
    Balanced strands for asymmetric, edge-graceful spiders. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  6. Hongxiang Li, Yixun Lin
    On the boundary inequality for bandwidth of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  7. Ursala Lenkewitz, Lutz Volkmann
    Neighbourhood and degree conditions for the existence of regular factors. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  8. Sylvia D. Monson
    The effects of vertex deletion and edge deletion on the clique partition number. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  9. Norbert Sauer, Jozef Sirán
    The chromatic number of the union of two forests. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  10. Wai Chee Shiu
    Difference sets in groups containing subgroups of index 2. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  11. Mirko Hornák, Roman Sotak
    The fifth jump of the point-distinguishing chromatic index of Kn, n. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  12. Terry S. Griggs, Alexander Rosa
    An invariant for one-factorizations of the complete graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  13. R. Bodendiek, G. Walther
    On (A, D)-antimagic parachutes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  14. Leonid Brailovsky, M. Herzog
    Counting squares of two-subsets in finite groups. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  15. Leonid Brailovsky, Dmitrii V. Pasechnik, Cheryl E. Praeger
    Classified of 2-quasi-invariant subsets. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  16. Dominique Buset
    Locally Pkn graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  17. Yair Caro
    Simple proffs to three parity theorems. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  18. Robin J. Chapman, Julie Haviland
    The rotation index of a graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  19. Markus Eckstein
    An upper bound for the depth-r interval number of the complete graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  20. Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
    Shortest walks in almost claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  21. Anant P. Godbole, Sandra E. Thompson, Eric Vigoda
    General upper bounds for covering numbers. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  22. Zhang Xuebin
    On the existence of (v, 4, 1)-RPMD. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, 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