The SCEAS System
Navigation Menu

Journals in DBLP

Eur. J. Comb.
2006, volume: 27, number: 7

  1. Jaroslav Nesetril
    Preface. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1055-1058 [Journal]
  2. Margaret Archibald, Arnold Knopfmacher, Helmut Prodinger
    The number of distinct values in a geometrically distributed sample. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1059-1081 [Journal]
  3. Olivier Bodini
    Tilings on the butterfly lattice. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1082-1087 [Journal]
  4. Zdenek Dvorak, Tomás Kaiser, Daniel Král
    Eulerian colorings and the bipartizing matchings conjecture of Fleischner. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1088-1101 [Journal]
  5. Shalom Eliahou, Michel Kervaire
    The small sumsets property for solvable finite groups. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1102-1110 [Journal]
  6. Jirí Fiala, Jana Maxová
    Cantor-Bernstein type theorem for locally constrained graph homomorphisms. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1111-1116 [Journal]
  7. Petr Hlinený, Geoff Whittle
    Matroid tree-width. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1117-1128 [Journal]
  8. Winfried Hochstättler, Jaroslav Nesetril
    Antisymmetric flows in matroids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1129-1134 [Journal]
  9. Gyula Károlyi
    A note on the Hopf-Stiefel function. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1135-1137 [Journal]
  10. Christian Krattenthaler
    Descending plane partitions and rhombus tilings of a hexagon with a triangular hole. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1138-1146 [Journal]
  11. Tomasz Luczak, Jaroslav Nesetril
    When is a random graph projective? [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1147-1154 [Journal]
  12. Reza Naserasr
    K5-Free bound for the class of planar graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1155-1158 [Journal]
  13. Jaroslav Nesetril, Yared Nigussie
    Minimal universal and dense minor closed classes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1159-1171 [Journal]
  14. Arnaud Pêcher, Annegret Wagler
    A construction for non-rank facets of stable set polytopes of webs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1172-1185 [Journal]
  15. Alain Plagne
    On threshold properties of k-SAT: An additive viewpoint. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1186-1198 [Journal]
  16. Attila Pór, Pavel Valtr
    On the positive fraction Erdos-Szekeres theorem for convex sets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1199-1205 [Journal]
  17. Alexander A. Sapozhenko
    Independent sets in quasi-regular graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1206-1210 [Journal]
  18. László Szegö
    On constructive characterizations of (k, l)-sparse graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1211-1223 [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