Journals in DBLP
Jørgen Bang-Jensen , Gregory Gutin , Jing Huang A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:1-12 [Journal ] Arrigo Bonisoli , Gábor Korchmáros Suzuki groups, one-factorizations and Lüneburg planes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:13-24 [Journal ] André Bouchet , Laurence Ghier Connectivity and beta-invariants of isotropic systems and 4-regular graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:25-44 [Journal ] Luis Boza , Ana Diánez , Alberto Márquez The center of an infinite graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:45-52 [Journal ] Rainer E. Burkard , Tibor Dudás , Thomas Maier Cut and patch Steiner trees for ladders. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:53-61 [Journal ] Michael B. Dillencourt , Warren D. Smith Graph-theoretical conditions for inscribability and Delaunay realizability. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:63-77 [Journal ] David Dorrough Convergence of sequences of iterated triangular line graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:79-86 [Journal ] Alexandru Filipoiu , George Georgescu On values in relatively normal lattices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:87-100 [Journal ] Markus Fulmek , Christian Krattenthaler A bijection between Proctor's and Sundaram's odd orthogonal tableaux. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:101-120 [Journal ] Wayne Goddard , Henda C. Swart Distances between graphs under edge operations. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:121-132 [Journal ] Jaroslaw Grytczuk Infinite self-similar words. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:133-141 [Journal ] Johann Hagauer , Sandi Klavzar Clique-gated graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:143-149 [Journal ] T. E. Hall , Mark V. Sapir Idempotents, regular elements and sequences from finite semigroups. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:151-160 [Journal ] Michael A. Henning , Ortrud R. Oellermann , Henda C. Swart The diversity of domination. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:161-173 [Journal ] Michael A. Henning , Ortrud R. Oellermann , Henda C. Swart Local edge domination critical graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:175-184 [Journal ] Jianping Li , Feng Tian A proof of a conjecture about Dlambda -paths in graphs with large neighborhood unions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:185-196 [Journal ] Daphne Der-Fen Liu T-graphs and the channel assignment problem. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:197-205 [Journal ] Oscar Ordaz , Denise Amar , André Raspaud Hamiltonian properties and the bipartite independence number. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:207-215 [Journal ] Themistocles Politof , A. Satyanarayana The structure of quasi 4-connected graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:217-228 [Journal ] Shijun Ren A sufficient condition for graphs with large neighborhood unions to be traceable. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:229-234 [Journal ] E. Sampathkumar , L. Pushpa Latha Strong weak domination and domination balance in a graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:235-242 [Journal ] Ramesh S. Sankaranarayana , Lorna K. Stewart Recursively decomposable well-covered graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:243-263 [Journal ] R. I. Tyshkevich , Vadim E. Zverovich Line hypergraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:265-283 [Journal ] S. Arumugam , K. A. Germina On indexable graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:285-289 [Journal ] Marco Buratti Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:291-295 [Journal ] Martin Kochol A cyclically 6-edge-connected snark of order 118. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:297-300 [Journal ] Alexander Kreinin , Alek Vainshtein Asymptotics for Morgan numbers of fractional orders. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:301-308 [Journal ] Dayanand S. Rajan , Anil M. Shende A characterization of root lattices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:309-314 [Journal ] Eckhard Steffen Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:315- [Journal ] Gh. Toader On Chebyshev's inequality for sequences. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:317-322 [Journal ] Hong Zhang Characterization of self-complementary symmetric digraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:161, n:1-3, pp:323-327 [Journal ]