Journals in DBLP
David W. Bange , Anthony E. Barkauskas , Peter J. Slater Sequentially additive graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:235-241 [Journal ] C. C. Chen , P. Manalastas Every finite strongly connected digraph of stability 2 has a Hamiltonian path. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:243-250 [Journal ] Ales Drápal On quasigroups rich in associative triples. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:251-265 [Journal ] E. J. Farrell Forest decompositions of ladders. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:267-274 [Journal ] Herbert Fleischner Even cycles with prescribed chords in planar cubic graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:275-280 [Journal ] Gena Hahn , Dominique Sotteau , H. Sun Short cycles in mediate graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:281-284 [Journal ] C. J. Liu , Yutze Chow An operator approach to some graph enumeration problems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:285-291 [Journal ] Bruce E. Sagan A note on Abel polynomials and rooted labeled forests. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:293-298 [Journal ] M. G. Stone , R. H. Weedmark On representing M_{n} 's by congruence lattice of finite algebras. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:299-308 [Journal ] Henk Jan Veldman Existence of D_{lambda} -cycles and D_{lambda} -paths. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:309-316 [Journal ] Geoffrey Exoo On line disjoint paths of bounded length. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:317-318 [Journal ] Jerald A. Kabell A note on colorings of finite planes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:319-320 [Journal ] Fred R. McMorris , G. T. Myers Some uniqueness results for upper bound. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:321-323 [Journal ] Doron Zeilberger Andre's reflection proof generalized to the many-candidate ballot problem. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:325-326 [Journal ] P. J. Owens Bipartite cubic graphs and a shortness exponent. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:327-330 [Journal ] Aviezri S. Fraenkel Problem 38. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:331-333 [Journal ] Aviezri S. Fraenkel Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:333- [Journal ] Aviezri S. Fraenkel Problem 40. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:44, n:3, pp:333-334 [Journal ]