The SCEAS System
Navigation Menu

Journals in DBLP

Electr. J. Comb.
2001, volume: 8, number: 1

  1. Xuding Zhu
    Circular Chromatic Number of Planar Graphs of Large Odd Girth. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  2. James Gary Propp
    A Reciprocity Theorem for Domino Tilings. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  3. Michael Plantholt, Shailesh K. Tipnis
    All Regular Multigraphs of Even Order and High Degree Are 1-factorable. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  4. Patric R. J. Östergård, William D. Weakley
    Values of Domination Numbers of the Queen's Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  5. Thomas Niessen
    How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  6. Mikhail E. Muzychuk, Gottfried Tinhofer
    Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  7. Yifan Yang
    On a Multiplicative Partition Function. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  8. Daniel Kobler, André Kündgen
    Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  9. Bojan Mohar, Riste Skrekovski
    Nowhere-zero k-flows of Supergraphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  10. Alexander K. Kelmans, Dhruv Mubayi, Benny Sudakov
    Asymptotically Optimal Tree-Packings in Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  11. Yury J. Ionin
    Applying Balanced Generalized Weighing Matrices to Construct Block Designs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  12. Gaetano Quattrocchi
    Colouring 4-cycle Systems with Specified Block Colour Patterns: the Case of Embedding P3-designs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  13. Leigh Roberts
    A Unified View of Determinantal Expansions for Jack Polynomials. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  14. Bruce E. Sagan, John S. Caughman IV
    The Multiplicities of a Dual-thin Q-polynomial Association Scheme. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  15. Doron Zeilberger
    The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  16. David Bruce Wilson
    Diagonal Sums of Boxed Plane Partitions. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  17. Ben Wieland, Anant P. Godbole
    On the Domination Number of a Random Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  18. Eric Vigoda
    A Note on the Glauber Dynamics for Sampling Independent Sets. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  19. Ulrich Tamm
    Some Aspects of Hankel Matrices in Coding Theory and Combinatorics. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  20. Mark Skandera
    Dumont's Statistic on Words. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  21. Dan Singer
    On Catalan Trees and the Jacobian Conjecture. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  22. Mark Shimozono, Dennis E. White
    A Color-to-Spin Domino Schensted Algorithm. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  23. Jeffrey Shallit, Ming-wei Wang
    Weakly Self-Avoiding Words and a Construction of Friedman. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  24. Gábor N. Sárközy, Stanley M. Selkow
    On Edge Colorings with at Least q Colors in Every Subset of p Vertices. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  25. Ralph Howard, Gyula Károlyi, László A. Székely
    Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  26. Michael E. Hoffman
    An Analogue of Covering Space Theory for Ranked Posets. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  27. Alain Lascoux
    About Division by 1. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  28. Grant Cairns
    Queens on Non-square Tori. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  29. Matthias Beck, Ira M. Gessel, Takao Komatsu
    The Polynomial Part of a Restricted Partition Function Related to the Frobenius Problem. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  30. D. de Caen
    A Note on the Ranks of Set-Inclusion Matrices. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  31. János Barát, Péter Hajnal
    The Arc-Width of a Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  32. Jason Bandlow, Kendra Killpatrick
    An Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  33. Chunhui Lai
    A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  34. Alex Brodsky, Stephane Durocher, Ellen Gethner
    The Rectilinear Crossing Number of K10 is 62. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  35. Richard P. Anstee, Ron Ferguson, Attila Sali
    Small Forbidden Configurations II. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  36. Jenny Alvarez, Miguel Amadis, George Boros, Dagan Karp, Victor H. Moll, Leobardo Rosales
    An Extension of a Criterion for Unimodality. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  37. Ara Aleksanyan, Mihran Papikian
    On Coset Coverings of Solutions of Homogeneous Cubic Equations over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  38. E. Rodney Canfield
    Meet and Join within the Lattice of Set Partitions. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  39. Yair Caro, Cecil C. Rousseau
    Asymptotic Bounds for Bipartite Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  40. Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
    General Bounds for Identifying Codes in Some Infinite Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  41. Andrew Granville, J. L. Selfridge
    Product of Integers in an Interval, Modulo Squares. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  42. Markus Fulmek, Michael Kleber
    Bijective Proofs for Schur Function Identities which Imply Dodgson's Condensation - Formula and Plu"cker Relations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  43. Stefan Felsner
    The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  44. Giovanni Lo Faro, Lorenzo Milazzo, Antoinette Tripodi
    On the Upper and Lower Chromatic Numbers of BSQSs(16). [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  45. Ömer Egecioglu, Timothy Redmond, Charles Ryavec
    From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  46. Zdenek Dvorak, Daniel Král
    On Planar Mixed Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  47. Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter
    Spanning Trees of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  48. L. J. Cummings, M. Mays
    A One-Sided Zimin Construction. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  49. Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton
    Guessing Secrets. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  50. Philippe Chassaing, Jean-François Marckert
    Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  51. Anthony Bonato, Wolf H. Holzmann, Hadi Kharaghani
    Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [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