The SCEAS System
Navigation Menu

Journals in DBLP

Ars Comb.
2007, volume: 83, number:


  1. The generalized exponent sets of primitive, minimally strong digraphs (II). [Citation Graph (, )][DBLP]


  2. The K-behaviour of p-trees. [Citation Graph (, )][DBLP]


  3. The Edge Choosability of Cn x Pm. [Citation Graph (, )][DBLP]


  4. On the Intersection of two m-sets and the Erdos-Ginzburg-Ziv Theorem. [Citation Graph (, )][DBLP]


  5. A New Upper Bound On Forwarding Index of Graphs. [Citation Graph (, )][DBLP]


  6. On (t, k)-shredders in k-connected graphs. [Citation Graph (, )][DBLP]


  7. Erratum: a little emendation to the graceful labelling of the Generalized Petersen Graph P8t, 3 when t = 5. [Citation Graph (, )][DBLP]


  8. On imp-sets, kernels by monochromatic paths of the duplication. [Citation Graph (, )][DBLP]


  9. A Characterization of the Generalized Lah Matrix. [Citation Graph (, )][DBLP]


  10. Some Results on Fractional Edge Coloring of Graphs. [Citation Graph (, )][DBLP]


  11. Summation of Reciprocals Related to l-th Power of Generalized Fibonacci Sequences. [Citation Graph (, )][DBLP]


  12. Average distance in bipartite tournaments. [Citation Graph (, )][DBLP]


  13. Non-Fano Quads in Finite Projective Planes. [Citation Graph (, )][DBLP]


  14. On the Spectral Radius of Unicyclic Graphs with n Vertices and Edge Independence Number q. [Citation Graph (, )][DBLP]


  15. On a well-spread halving of regular multigraphs. [Citation Graph (, )][DBLP]


  16. The Last Descent In Samples Of Geometric Random Variables And Permutations. [Citation Graph (, )][DBLP]


  17. Counting pan-fan maps on nonorientable surfaces. [Citation Graph (, )][DBLP]


  18. All graphs are set reconstructible if all 2-connected graphs are set reconstructible. [Citation Graph (, )][DBLP]


  19. Irreducible cyclic codes of length 2pn. [Citation Graph (, )][DBLP]


  20. Odd and Even Dominating Sets with Open Neighborhoods. [Citation Graph (, )][DBLP]


  21. A New Lower Bound for A(17, 6, 6). [Citation Graph (, )][DBLP]


  22. The Restricted Edge-Connectivity of de Bruijn Undirected Graphs. [Citation Graph (, )][DBLP]


  23. Extremal bipartite graphs with high girth. [Citation Graph (, )][DBLP]


  24. 2n-cyclic Blended Labeling of Graphs. [Citation Graph (, )][DBLP]


  25. Graceful Labeling Of A Family Of Quasistars With Paths In Arithmetic Progression. [Citation Graph (, )][DBLP]


  26. Asymptotic density of brick and word codes. [Citation Graph (, )][DBLP]


  27. Four Colour Classes in Projective Planes with Non-Fano Quads. [Citation Graph (, )][DBLP]


  28. The Major Index Specialization of the q, t-Catalan. [Citation Graph (, )][DBLP]


  29. The k-exponents of Primitive, Nearly Reducible Matrices. [Citation Graph (, )][DBLP]


  30. The Ehrenfeucht-Fraisse Game for Paths and Cycles. [Citation Graph (, )][DBLP]

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