The SCEAS System
Navigation Menu

Journals in DBLP

Eur. J. Comb.
2010, volume: 31, number: 5


  1. A systematic approach to matrix forms of the Pascal triangle: The twelve triangular matrix forms and relations. [Citation Graph (, )][DBLP]


  2. Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. [Citation Graph (, )][DBLP]


  3. Ramsey goodness and generalized stars. [Citation Graph (, )][DBLP]


  4. On the lower bounds for the maximum genus for simple graphs. [Citation Graph (, )][DBLP]


  5. Addition of sets via symmetric polynomials - A polynomial method. [Citation Graph (, )][DBLP]


  6. A classification of nonabelian simple 3-BCI-groups. [Citation Graph (, )][DBLP]


  7. Klazar trees and perfect matchings. [Citation Graph (, )][DBLP]


  8. Discrete piecewise linear functions. [Citation Graph (, )][DBLP]


  9. The L(h, 1, 1)-labelling problem for trees. [Citation Graph (, )][DBLP]


  10. Perfect matchings with restricted intersection in cubic graphs. [Citation Graph (, )][DBLP]


  11. An improved linear bound on the number of perfect matchings in cubic graphs. [Citation Graph (, )][DBLP]


  12. Circuit and fractional circuit covers of matroids. [Citation Graph (, )][DBLP]


  13. The enumeration of fully commutative affine permutations. [Citation Graph (, )][DBLP]


  14. The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2. [Citation Graph (, )][DBLP]


  15. Minimal identifying codes in trees and planar graphs with large girth. [Citation Graph (, )][DBLP]


  16. Planar graphs are 1-relaxed, 4-choosable. [Citation Graph (, )][DBLP]


  17. On subsets of F1n containing no k-term progressions. [Citation Graph (, )][DBLP]


  18. The largest and the smallest fixed points of permutations. [Citation Graph (, )][DBLP]


  19. Symmetric 1-factorizations of the complete graph. [Citation Graph (, )][DBLP]


  20. On graphs isomorphic to their neighbour and non-neighbour sets. [Citation Graph (, )][DBLP]


  21. Sets with involutions: Power group enumeration. [Citation Graph (, )][DBLP]


  22. Minimal permutations with d descents. [Citation Graph (, )][DBLP]


  23. A short proof of a theorem of Bang and Koolen. [Citation Graph (, )][DBLP]


  24. Some weak indivisibility results in ultrahomogeneous metric spaces. [Citation Graph (, )][DBLP]


  25. Cyclic Hamiltonian cycle systems of the lambda-fold complete and cocktail party graphs. [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