The SCEAS System
Navigation Menu

Journals in DBLP

Ars Comb.
2007, volume: 82, number:


  1. On Optimal Orientations Of Tensor Product Of Complete Graphs. [Citation Graph (, )][DBLP]


  2. A characterization of (alpha, s + 1)-geometries 1 < alpha < s + 1, satisfying the axiom of Pasch. [Citation Graph (, )][DBLP]


  3. An Improved Method for Finding Knight Covers. [Citation Graph (, )][DBLP]


  4. Nested Partially Balanced Incomplete Block Design. [Citation Graph (, )][DBLP]


  5. On Splitting Graphs. [Citation Graph (, )][DBLP]


  6. Monochromatic Fibonacci Numbers of Graphs. [Citation Graph (, )][DBLP]


  7. On 2-Factors with Quadrilaterals Containing Specified Vertices in a Bipartite Graph. [Citation Graph (, )][DBLP]


  8. Assigning Bookmarks in Perfect Binary Trees. [Citation Graph (, )][DBLP]


  9. Erratum to "Inducing regularization of graphs, multigraphs and pseudographs" [Ars Combinatoria 65 (2002), 129-133]. [Citation Graph (, )][DBLP]


  10. Embedding graphs without edge accumulation points in tubular surfaces. [Citation Graph (, )][DBLP]


  11. Large Chordal Rings for Given Diameter and Uniqueness Property of Minima. [Citation Graph (, )][DBLP]


  12. The Forcing Domination Numbers Of Some Graphs. [Citation Graph (, )][DBLP]


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


  14. Zero-Sum Magic Graphs And Their Null Sets. [Citation Graph (, )][DBLP]


  15. Domination Graphs of Extended Rotational Tournaments: Chords and Cycles. [Citation Graph (, )][DBLP]


  16. Binomial Identities Generated by Counting Spanning Trees. [Citation Graph (, )][DBLP]


  17. Classification Of Large Sets By Trades. [Citation Graph (, )][DBLP]


  18. On 3-Hypergraphs with Equal Degree Sequences. [Citation Graph (, )][DBLP]


  19. On The Spectrum Of Critical Sets In Back Circulant Latin Squares. [Citation Graph (, )][DBLP]


  20. Finding The Chromatic Polynomial Of Cayley Graphs Using The Tutte Polynomial. [Citation Graph (, )][DBLP]


  21. Determining a permutation from its set of reductions. [Citation Graph (, )][DBLP]


  22. (t, k)-Geodetic Set of a Graph. [Citation Graph (, )][DBLP]


  23. On K*-Ultrahomogeneous Graphs. [Citation Graph (, )][DBLP]


  24. On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs. [Citation Graph (, )][DBLP]


  25. Construction for OGDD of Type 44. [Citation Graph (, )][DBLP]


  26. Some results on mod (integral) sum graphs. [Citation Graph (, )][DBLP]


  27. Realizability Results Involving Two Connectivity Parameters. [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