default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 6
Volume 6, Number 1, September 1973
- Morton Abramson, William O. J. Moser:
Arrays with fixed row and column sums. 1-14 - H. Burkill, L. Mirsky:
Combinatorial problems on the existence of large submatrices I. 15-28 - C. J. Everett, P. R. Stein:
The asymptotic number of (0, 1)-matrices with zero permanent. 29-34 - Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Theory of path length distributions I. 35-52 - Gary Haggard:
The least number of edges for graphs having dihedral automorphism group. 53-78 - Daniel J. Kleitman, D. L. Wang:
Algorithms for constructing graphs and digraphs with given valences and factors. 79-88 - D. F. Robinson:
Extending a function on a graph. 89-99 - Steve Gallant:
On the group and the circuit group of a graph. 101-103
Volume 6, Number 2, 1973
- Norman Biggs:
Expansions of the chromatic polynomial. 105-113 - Rodney W. Forcade:
Parity of paths and circuits in tournaments. 115-118 - Robert G. Jeroslow:
Linear programs dependent on a single parameter. 119-140 - Daniel J. Kleitman, E. C. Milner:
On the average size of the sets in a Sperner family. 141-147 - Charles C. Lindner:
On the construction of cyclic quasigroups. 149-158 - Torrence D. Parsons:
The Ramsey numbers r(Pm, Kn). 159-162 - Pushpa N. Rathie:
The enumeration of Hamiltonian polygons in rooted planar triangulations. 163-168 - Richard D. Ringeisen:
Graphs of given genus and arbitrarily large maximum genus. 169-174 - Douglas R. Shier:
A decomposition algorithm for optimality problems in tree-structured networks. 175-189
Volume 6, Number 3, 1973
- William G. Bridges:
Replication results for certain combinatorial configurations. 191-199 - Thomas H. Brylawski:
The lattice of integer partitions. 201-219 - Fred W. Glover:
Convexity cuts for multiple choice problems. 221-234 - Gabor T. Herman, K. P. Lee, Jan van Leeuwen
, Grzegorz Rozenberg:
Characterization of unary developmental languages. 235-247 - Ernest Jucovic:
Analogues of eberhard's theorem for 4-valent 3-polytopes with involutory automorphisms. 249-254 - Daniel J. Kleitman, Joel H. Spencer:
Families of k-independent sets. 255-262 - K. B. Reid:
Equivalence of n-tournaments via k-path reversals. 263-280 - David P. Sumner:
Graphs indecomposable with respect to the X-join. 281-298 - Luc Teirlinck:
On the maximum number of disjoint Steiner triple systems. 299-300 - Luc Teirlinck:
The existence of reverse Steiner triple systems. 301-302
Volume 6, Number 4, 1973
- R. C. Bose, S. S. Shrikhande:
Embedding the complement of an oval in a projective plane of even order. 305-312 - Robert Bruce Brown:
Sequences of functions of binomial type. 313-331 - Thomas H. Brylawski:
Some properties of basic families of subsets. 333-341 - Michel Deza:
Une propriete extremale des plans projectifs finis dans une classe de codes equidistants. 343-352 - Jack H. van Lint:
A theorem on equidistant codes. 353-358 - Frank Harary, Allen J. Schwenk:
The number of caterpillars. 359-365 - Sukhamay Kundu:
The k-factor conjecture is true. 367-376 - Edgar M. Palmer:
On the number of n-plexes. 377-390 - Chak-Kuen Wong, P. C. Yue:
A majorization theorem for the number of distinct outcomes in n independent trials. 391-398
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
