The SCEAS System
Navigation Menu

Journals in DBLP

Eur. J. Comb.
2009, volume: 30, number: 7


  1. Preface. [Citation Graph (, )][DBLP]


  2. New results on lower bounds for the number of (<=k)-facets. [Citation Graph (, )][DBLP]


  3. On the graph of a function over a prime field whose small powers have bounded degree. [Citation Graph (, )][DBLP]


  4. On a conjecture of Graham and Häggkvist with the polynomial method. [Citation Graph (, )][DBLP]


  5. Mixing 3-colourings in bipartite graphs. [Citation Graph (, )][DBLP]


  6. Discrepancy in generalized arithmetic progressions. [Citation Graph (, )][DBLP]


  7. Vertex fusion under distance constraints. [Citation Graph (, )][DBLP]


  8. Matching graphs of hypercubes and complete bipartite graphs. [Citation Graph (, )][DBLP]


  9. Two remarks on the Burr-Erdos conjecture. [Citation Graph (, )][DBLP]


  10. Bijective counting of plane bipolar orientations and Schnyder woods. [Citation Graph (, )][DBLP]


  11. Homomorphisms and polynomial invariants of graphs. [Citation Graph (, )][DBLP]


  12. Enumeration of simple complete topological graphs. [Citation Graph (, )][DBLP]


  13. Generalizations of Heilbronn's triangle problem. [Citation Graph (, )][DBLP]


  14. Fraternal augmentations, arrangeability and linear Ramsey numbers. [Citation Graph (, )][DBLP]


  15. Removing even crossings on surfaces. [Citation Graph (, )][DBLP]


  16. Bounds on the number of maximal sum-free sets. [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