The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2001, volume: 230, number: 1-3

  1. Arthur M. Hobbs, Hong-Jian Lai
    Dedication. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:1-0 [Journal]
  2. Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson
    Paul Catlin 1948-1995. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:3-12 [Journal]
  3. Edgar M. Palmer
    On the spanning tree packing number of a graph: a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:13-21 [Journal]
  4. Herbert Fleischner
    (Some of) the many uses of Eulerian graphs in graph theory (plus some applications). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:23-43 [Journal]
  5. Heiko Harborth
    Eulerian straight ahead cycles in drawings of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:45-48 [Journal]
  6. Anna Lee, Gábor Révész, Jenö Szigeti, Zsolt Tuza
    Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:49-61 [Journal]
  7. Hong-Jian Lai
    Eulerian subgraphs containing given edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:63-69 [Journal]
  8. Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai
    Graph family operations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:71-97 [Journal]
  9. Ronald J. Gould
    Results on degrees and the structure of 2-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:99-111 [Journal]
  10. Xiaotao Cai, Warren E. Shreve
    Pancyclicity mod k of claw-free graphs and K1, 4-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:113-118 [Journal]
  11. Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski
    Stable 2-pairs and (X, Y)-intersection graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:119-131 [Journal]
  12. Zhi-hong Chen, Hong-Jian Lai, Hongyuan Lai
    Nowhere zero flows in line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:133-141 [Journal]
  13. Cun-Quan Zhang
    On strong 1-factors and Hamilton weights of cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:143-148 [Journal]
  14. Alexander K. Kelmans
    On graph planarity and semi-duality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:149-166 [Journal]
  15. Alexander K. Kelmans
    On Homotopy of connected graphs having the same degree function. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:167-187 [Journal]
  16. Rajeev Govindan, Siddharthan Ramachandramurthi
    A weak immersion relation on graphs and its applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:189-206 [Journal]
  17. Neil Robertson, Xiaoya Zha
    Closed 2-cell embeddings of graphs with no V8-minors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:207-213 [Journal]
  18. Michael J. Dinneen, Kevin Cattell, Michael R. Fellows
    Forbidden minors to graphs with small feedback sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:215-252 [Journal]
  19. J. J. Spencer
    The question of the collapsibility of random 3-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:253-0 [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