The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1992, volume: 101, number: 1-3

  1. Kathie Cameron, Jack Edmonds
    Coflow polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:1-21 [Journal]
  2. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau
    Extremal problems involving vertices and edges on odd cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:23-31 [Journal]
  3. Herbert Fleischner
    Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:33-37 [Journal]
  4. Herbert Fleischner, Michael Stiebitz
    A solution to a colouring problem of P. Erdös. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:39-48 [Journal]
  5. András Frank
    On a theorem of Mader. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:49-57 [Journal]
  6. Zoltán Füredi
    Indecomposable regular graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:59-64 [Journal]
  7. Jerrold R. Griggs, Joan P. Hutchinson
    On the r-domination number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:65-72 [Journal]
  8. Harald Gropp
    Enumeration of regular graphs 100 years ago. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:73-85 [Journal]
  9. Ervin Györi, Michael D. Plummer
    The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:87-96 [Journal]
  10. R. Halin
    Some finiteness results concerning separation in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:97-106 [Journal]
  11. Denis Hanson
    A quick proof that K10 != P + P + P. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:107-108 [Journal]
  12. Denis Hanson, Ping Wang, Leif K. Jørgensen
    On cages with given degree sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:109-114 [Journal]
  13. Robert L. Hemminger, Xingxing Yu
    On 3-connected graphs with contractible edge covers of size k. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:115-133 [Journal]
  14. Anthony J. W. Hilton, Zhao Cheng
    The chromatic index of a graph whose core has maximum degree two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:135-147 [Journal]
  15. François Jaeger
    A new invariant of plane bipartite cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:149-164 [Journal]
  16. Hal A. Kierstead, William T. Trotter
    Colorful induced subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:165-169 [Journal]
  17. William Kocay
    An extension of the multi-path algorithm for finding hamilton cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:171-188 [Journal]
  18. Alexandr V. Kostochka
    List edge chromatic number of graphs with large girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:189-201 [Journal]
  19. Daphne Der-Fen Liu
    T-colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:203-212 [Journal]
  20. Jean Mayer
    Conjecture de Hadwiger: k = 6. II - réductions de sommets de degré 6 dans les graphes 6- chromatiques contraction-critiques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:213-222 [Journal]
  21. Jaroslav Nesetril, Vojtech Rödl
    On Ramsey graphs without bipartite subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:223-229 [Journal]
  22. K. B. Reid, Weizhen Gu
    Plurality preference digraphs realized by trees, II: on realization numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:231-249 [Journal]
  23. Gert Sabidussi
    Binary invariants and orientations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:251-277 [Journal]
  24. Horst Sachs
    How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:279-284 [Journal]
  25. Akira Saito
    Cycles of length 2 modulo 3 in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:285-289 [Journal]
  26. Karen Seyffarth
    Hajós' conjecture and small cycle double covers of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:291-306 [Journal]
  27. Michael Stiebitz
    On Hadwiger's number - a problem of the Nordhaus-Gaddum type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:307-317 [Journal]
  28. Henk Jan Veldman
    Cycles containing many vertices of large degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:319-325 [Journal]
  29. Douglas R. Woodall
    An inequality for chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:327-331 [Journal]
  30. Douglas R. Woodall
    A zero-free interval for chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:333-341 [Journal]
  31. D. A. Youngs
    Gallai's problem on Dirac's construction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:343-350 [Journal]
  32. Jørgen Bang-Jensen, Bjarne Toft
    Unsolved problems presented at the Julius Petersen Graph Theory Conference. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:351-360 [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