default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 9
Volume 9, Number 1, July 1974
- William G. Bridges, Mohan S. Shrikhande:
Special partially balanced incomplete block designs and associated graphs. 1-18 - G. A. Dirac:
Terminable and interminable paths and trails in infinite graphs. 19-34 - Antal Majthay, Andrew B. Whinston:
Quasi-concave minimization subject to linear constraints. 35-59 - Arnold L. Rosenberg:
An extrinsic characterization of addressable data graphs. 61-70 - Arto Salomaa:
Solution of a decision problem concerning unary Lindenmayer systems. 71-77 - Stephen M. Tanny, Michael Zuker:
On a unimodal sequence of binomial coefficients. 78-89 - Carsten Thomassen:
Hypohamiltonian and hypotraceable graphs. 91-96 - W. T. Tuttle:
Spanning subgraphs with specified valencies. 97-108
Volume 9, Number 2, 1974
- Fred W. Glover:
First facets of the octahedron. 109-117 - P. J. Gustav Meyer:
On the structure of orthomodular posets. 119-146 - Charlotte Huang:
On the existence of balanced bipartite designs, II. 147-159 - François Jaeger:
Sur l'indice chromatique du graphe representatif des aretes d'un graphe regulier. 161-172 - Sukhamay Kundu:
Generalizations of the k-factor theorem. 173-179 - Richard M. Wilson:
Concerning the number of mutually orthogonal latin squares. 181-198
Volume 9, Number 3, September 1974
- H. L. Abbott:
Some results in combinatorial geometry. 199-204 - Peter Buneman:
A characterisation of rigid circuit graphs. 205-212 - R. H. F. Denniston:
Some packings with Steiner triple systems. 213-227 - R. H. F. Denniston:
Sylvester's problem of the 15 schoolgirls. 229-233 - M. Gondran:
Remarque sur le polytope des couplages d'edmonds. 235-238 - Jonathan L. Gross:
Voltage graphs. 239-246 - Xavier L. Hubaut:
Two new families of 4-designs. 247-249 - Robert W. Irving:
Generalised Ramsey numbers for small graphs. 251-264 - Ivan Tafteberg Jakobsen:
On critical graphs with chromatic index 4. 265-276 - K. L. McAvaney, Douglas D. Grant, Derek A. Holton:
Stable and semi-stable unicyclic graphs. 277-288 - Edward M. Wright:
Two problems in the enumeration of unlabelled graphs. 289-292 - John Zolnowsky:
A direct combinatorial proof of the Jacobi identity. 293-298
Volume 9, Number 4, October 1974
- Edward A. Bender:
Partitions of multisets. 301-311 - Jean-Claude Bermond:
Some Ramsey numbers for directed graphs. 313-321 - Kenneth P. Bogart:
A note on matrices of zeros and ones. 323-327 - Ronald V. Book, Michael A. Harrison:
Mutually divisible semigroups. 329-332 - N. G. de Bruijn:
Sorting by means of swappings. 333-339 - C. Domb, A. J. Barrett:
Enumeration of ladder graphs. 341-358 - B. G. Eke:
Monotonic triads. 359-363 - H. O. Foulkes:
Paths in ordered structures of partitions. 365-374 - Dennis P. Geller:
Walkwise and admissible mappings between digraphs. 375-390 - Colin L. Mallows, Neil J. A. Sloane:
Weight enumerators of self-orthogonal codes. 391-400
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-03-05 20:39 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:
