Discrete Mathematics, Volume 44

Volume 44, Number 1, 1983

Ron Aharoni: A principle of symmetry in networks. 1-11
Ronald D. Baker:
Resolvable bibd and sols. 13-29
Edward A. Bertram:
Some applications of graph theory to finite groups. 31-43
Mark A. Buckingham, Martin Charles Golumbic:
Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture. 45-54
James G. Oxley: On a matroid identity. 55-60
Dinesh P. Rajkundlia:
Some techniques for constructing infinite families of BIBD'S. 61-96
James E. Simpson:
Langford sequences: perfect and hooked. 97-104
Henk Jan Veldman:
Non-kappa-critical vertices in graphs. 105-110
Mao-cheng Cai:
A counterexample to a conjecture of grant. 111
Alexander K. Kelmans, B. N. Kimelfeld:
Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications. 113-116
Masako Sato: Note on the number of minimal lattice paths restricted by two parallel lines. 117-121

Richard P. Anstee: The network flows approach for matrices with given row and column sums. 125-138
Robert C. Brigham, Ronald D. Dutton:
On clique covers and independence numbers of graphs. 139-144
Jeffrey H. Dinitz, Douglas R. Stinson:
Mols with holes. 145-154
Mario Gionfriddo:
On the set J(v) for Steiner Quadruple systems of order v = 2ⁿ with n>=4. 155-160
Seiya Negami:
Uniqueness and faithfulness of embedding of toroidal graphs. 161-180
J. R. Tort:
Un probleme de partition de l'ensemble des parties a trois elements d'un ensemble fini. 181-185
Alan Tucker: Uniquely colorable perfect graphs. 187-194
Yoko Usami:
Minimum number of edges in graphs that are both P₂- and P_i-connected. 195-199
Peter R. Wild:
Incidence graphs and subdesigns of semisymmetric designs. 201-216
J. A. Bondy, Pavol Hell:
Counterexamples to theorems of Menger type for the diameter. 217-220
Mauro Cerasoli:
On the probability of a Boolean polynomial of events. 221-227
Charles Payan:
Perfectness and dilworth number. 229-230

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

Last update Thu May 23 18:41:08 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page