The SCEAS System
Navigation Menu

Journals in DBLP

Ars Comb.
2003, volume: 67, number:

  1. S. Amghibech
    Eigenvalues of the Discrete p-Laplacian for Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  2. Alan C. H. Ling
    Some applications of combinatorial designs to extremal graph theory. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  3. Daphne Der-Fen Liu
    Sizes of Graphs with Fixed Orders and Spans for Circular-Distance-Two Labelings. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  4. Florent R. Madelaine, Iain A. Stewart
    Some problems not definable using structure homomorphisms. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  5. Livinus Ugochukwu Uko
    The anatomy of magic squares. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  6. Paul Renteln
    On the Chromatic Number of the Complement of a Class of Line Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  7. Tay-Woei Shyu, Chiang Lin
    Isomorphic Path Decompositions of Crowns. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  8. R. Sternfeld, D. Koster, D. Kiel, R. Killgrove
    Self-Dual Confined Configurations With Ten Points. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  9. Koen Thas
    On Semi Quadrangles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  10. Lutz Volkmann
    Degree sequence conditions for super-edge-connected graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  11. Maged Z. Youssef
    New Families of Graceful Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  12. Christos Koukouvinos, Jennifer Seberry
    Orthogonal Designs of Kharaghani Type: I. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  13. Sin-Min Lee, Ebrahim Salehi
    Integer-Magic Spectra Of Amalgamations Of Stars And Cycles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  14. MingChu Li
    Circumferences of 2-Connected Claw-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  15. Mahesh M. Andar, Samina Boxwala, Nirmala B. Limaye
    On the Cordiality of the t-Uniform Homeomorphs - II (Complete Graphs). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  16. Hui Kheng Aw, Yeow Meng Chee, Alan C. H. Ling
    Six New Constant Weight Binary Codes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  17. J. Barraud, A. Panayotopoulos, P. Tsikouras
    Properties of closed meanders. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  18. Andreas Brandstädt, Vadim V. Lozin
    On the linear structure and clique-width of bipartite permutation graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  19. Fred Buckley, Wing Yen Lau
    Mutually Eccentric Vertices in Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  20. Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko
    Powers of Asteroidal Triple-free Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  21. Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart
    Twin Domination in Digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  22. Margaret Ann Francel, David J. John
    3-Regular Hypergraphs that are Decomposable and Threshold. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  23. Ruth Haas, Denis Hanson, Gary MacGillivray
    Bounds For Partial List Colourings. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  24. Thomas Hull
    Counting Mountain-Valley Assignments for Flat Folds. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  25. Raphael Yuster
    A note on graphs without k-connected subgraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, 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