The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Discrete Math.
1992, volume: 5, number: 4

  1. Albrecht Beutelspacher, Dieter Jungnickel, Paul C. van Oorschot, Scott A. Vanstone
    Pair-Splitting Sets in AG(m, q). [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:451-459 [Journal]
  2. Philip Botti, Russell Merris, Cheryl Vega
    Laplacian Permanents of Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:460-466 [Journal]
  3. Graham Brightwell, Colin Wright
    The 1/3-2/3 Conjecture for 5-Thin Posets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:467-474 [Journal]
  4. Sunil Chopra
    The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:475-490 [Journal]
  5. Genghua Fan
    Covering Graphs by Cycles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:491-496 [Journal]
  6. Seyoum Getu, Louis W. Shapiro, Wen-Jin Woan, Leon C. Woodson
    How to Guess a Generating Function. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:497-499 [Journal]
  7. Kwang Soo Hong, Joseph Y.-T. Leung
    Some Results on Liu's Conjecture. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:500-523 [Journal]
  8. Garth Isaak, Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts
    2-Competition Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:524-538 [Journal]
  9. Michael S. Jacobson
    On the p-Edge Clique Cover Number of Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:539-544 [Journal]
  10. Bala Kalyanasundaram, Georg Schnitger
    The Probabilistic Communication Complexity of Set Intersection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:545-557 [Journal]
  11. Maria M. Klawe, Frank Thomson Leighton
    A Tight Lower Bound on the Size of Planar Permutation Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:558-563 [Journal]
  12. Christina Zamfirescu, Tudor Zamfirescu
    Hamiltonian Properties of Grid Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:564-570 [Journal]
  13. Jason I. Brown, Charles J. Colbourn
    Roots of the Reliability Polynomial. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:571-585 [Journal]
  14. Jerrold R. Griggs, Roger K. Yeh
    Labelling Graphs with a Condition at Distance 2. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:586-595 [Journal]
  15. Sampath Kannan, Moni Naor, Steven Rudich
    Implicit Representation of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:596-603 [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