Journals in DBLP
Kathie Cameron , Jack Edmonds Coflow polyhedra. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:101, n:1-3, pp:1-21 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]