dblp: Discrete Mathematics, Volume 38

Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary: The smallest 2-connected cubic bipartite planar nonhamiltonian graph. 1-6

Jacques Aubert, Bernadette Schneider: Decomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens. 7-16

Fred Buckley: The central ratio of a graph. 17-21

Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Ramsey-minimal graphs for forests. 23-32

Olivier Cogis: Ferrers digraphs and threshold graphs. 33-46

Olivier Cogis: On the Ferrers dimension of a digraph. 47-52

Nelly Darcel, Yvette Zimmermann: Partition en cycles du graphe de comparabilite d'un arbre. 53-64

Wen-Lian Hsu, George L. Nemhauser: A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs. 65-71

Stefan Porubský: A characterization of finite unions of arithmetic sequences. 73-77

C. R. Pranesachar: On the number of two-line and three-line latin rectangles - an alternative approach. 79-86

George B. Purdy: The independent sets of rank k of a matroid. 87-91

K. B. Reid: Every vertex a king. 93-98

David S. Witte: On Hamiltonian circuits in Cayley diagrams. 99-108

Mike J. Grannell, Terry S. Griggs: A cyclic Steiner quadruple system of order 32. 109-111

T. P. McDonough: A 2-design admitting Co₃. 113-115

Kazuhiko Ushio: On balanced claw designs of complete multi-partite graphs. 117-119

Richard E. Wendell: A preview of a tolerance approach to sensitivity analysis in linear programming. 121-124

G. Boccara: Cycles comme produit de deux permutations de classes donnees. 129-142

E. J. Farrell: Cycle decompositions of complete graphs. 143-156

John H. Conway, Vera Pless: On primes dividing the group order of a doubly-even (72, 36, 16) code and the group order of a quaternary (24, 12, 10) code. 157-162

Jean-Luc Fouquet: Note sur la non existence d'un snark d'ordre 16. 163-171

T. Gangopadhyay: Characterisation of potentially bipartite self-complementary bipartitioned sequences. 173-184

Marie-Claude Heydemann: Cycles in strong oriented graphs. 185-190

Michael S. Jacobson: On a generalization of Ramsey theory. 191-195

V. Krishnamoorthy, K. R. Parthasarathy: On the reconstruction of separable graphs from elementary contractions. 197-205

Aldo de Luca: On some combinatorial problems in free monoids. 207-225

P. A. Picon: Un résultat d'intégrité. 227-241

Norbert Polat: Sous-graphes traçables des graphes infinis. 243-263

Christiane Poupard: De nouvelles significations enumeratives des nombres d'entringer. 265-271

Richard L. Roth: Color symmetry and group theory. 273-296

Alexander Schrijver: On the number of edge-colourings of regular bipartite graphs. 297-301

Sue Whitesides: A classification of certain graphs with minimal imperfection properties. 303-310

Vladimir Batagelj, Tomaz Pisanski: Hamiltonian cycles in the cartesian product of a tree and a cycle. 311-312

David M. Bressoud, Doron Zeilberger: A short Rogers-Ramanujan bijection. 313-315

Alexander K. Kelmans, M. V. Lomonosov: When m vertices in a k-connected graph cannot be walked round along a simple cycle. 317-322

Discrete Mathematics, Volume 38

Volume 38, Number 1, January 1982

Volume 38, Numbers 2-3, 1982