The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1997, volume: 170, number: 1-3

  1. Nawarat Ananchuen, Lou Caccetta
    Matching extension and minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:1-13 [Journal]
  2. Frank E. Bennett, Ruizhong Wei
    The existence of Schröder designs with equal-sized holes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:15-28 [Journal]
  3. M. Bernstein, N. J. A. Sloane, Paul E. Wright
    On sublattices of the hexagonal lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:29-39 [Journal]
  4. Béla Bollobás, Alex D. Scott
    Independent sets and repeated degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:41-49 [Journal]
  5. Isma Bouchemakh, Konrad Engel
    The order-interval hypergraph of a finite poset and the König property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:51-61 [Journal]
  6. Gary Chartrand, Héctor Hevia, Elzbieta B. Jarrett, Michelle Schultz
    Subgraph distances in graphs defined by edge transfers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:63-79 [Journal]
  7. Davide Crippa, Klaus Simon
    q-distributions and Markov processes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:81-98 [Journal]
  8. Jitender S. Deogun, Dieter Kratsch, George Steiner
    1-Tough cocomparability graphs are hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:99-106 [Journal]
  9. Kequan Ding
    Rook placements and cellular decomposition of partition varieties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:107-151 [Journal]
  10. Ali Ridha Mahjoub
    On perfectly two-edge connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:153-172 [Journal]
  11. William P. Miller
    Techniques in matroid reconstruction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:173-183 [Journal]
  12. Hunter S. Snevily
    New families of graphs that have alpha-labelings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:185-194 [Journal]
  13. B. Wei
    Longest cycles in 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:195-201 [Journal]
  14. László Lipták
    Sperner systems containing at most k sets of every cardinality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:203-209 [Journal]
  15. Elena Barcucci, Alberto Del Lungo, S. Fezzi, Renzo Pinzani
    Nondecreasing Dyck paths and q-Fibonacci numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:211-217 [Journal]
  16. Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
    Spanning trees with pairwise nonadjacent endvertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:219-222 [Journal]
  17. Chiuyuan Chen, Chin-Chen Chang, Gerard J. Chang
    Proper interval graphs and the guard problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:223-230 [Journal]
  18. Guantao Chen, Richard H. Schelp, Warren E. Shreve
    A special k-coloring for a connected k-chromatic graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:231-236 [Journal]
  19. Arkady A. Chernyak, Zhanna A. Chernyak
    r-Multihypergraphs with prescribed edge degree sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:237-240 [Journal]
  20. D. Coulson
    An 18-colouring of 3-space omitting distance one. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:241-247 [Journal]
  21. Paul Erdös, László Pyber
    Covering a graph by complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:249-251 [Journal]
  22. Sylvain Gravier
    Hamiltonicity of the cross product of two Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:253-257 [Journal]
  23. Michael Krivelevich
    Almost perfect matchings in random uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:259-263 [Journal]
  24. Yusheng Li, Cecil C. Rousseau
    On the Ramsey number r(H+K_n, Kn). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:265-267 [Journal]
  25. Yusheng Li, Cecil C. Rousseau, Lubomír Soltés
    Ramsey linear families and generalized subdivided graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:269-275 [Journal]
  26. Jiping Liu, Huishan Zhou
    Maximum induced matchings in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:277-281 [Journal]
  27. Kevin McDougal
    A generalization of Ryser's theorem on term rank. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:283-288 [Journal]
  28. Victor Neumann-Lara
    Vertex critical 4-dichromatic circulant tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:289-291 [Journal]
  29. Christina Zamfirescu
    Cyclic and cliquewise connectedness of line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:293-297 [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