default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 18
Volume 18, Number 1, 1977
- Frances Chevarley Edmonds:
Enumeration of arrays of a given size. 1-22 - Stephen H. Y. Hung, N. S. Mendelsohn:
Handcuffed designs. 23-33 - Luisa Iturrioz, Olga Rueda:
Algebras implicatives trivalentes de Lukasiewicz libres. 35-44 - Heinz Adolf Jung, Mark E. Watkins:
On the structure of infinite vertex-transitive graphs. 45-53 - Victor A. Nicholson:
Collapsing unicolored graphs. 55-61 - Carl Pomerance:
On a tiling problem of R.B. Eggleton. 63-70 - Allen J. Schwenk:
An asymptotic evaluation of the cycle index of a symmetric group. 71-78 - Edward Spence:
Skew-Hadamard matrices of order 2(q + 1). 79-85 - H. P. Yap:
Some remarks on E-minimal graphs. 87-92 - Paul Smith:
A doubly divisible nearly Kirkman system. 93-96 - Charles Vanden Eynden:
On a paper of lake about infinite graphs. 97
Volume 18, Number 2, 1977
- Oldrich Botlík:
Modifications of object sizes and box capacities to achieve a simultaneous fitting. 105-108 - Victor Bryant, Hazel Perfect:
Some characterization theorems for circuit spaces associated with graphs. 109-124 - Sheshayya A. Choudum:
Some 4-valent, 3-connected, planar, almost pancyclic graphs. 125-129 - Karel Culík:
Extensions of rooted trees and their applications. 131-148 - Edward J. Farrell:
On graphical partitions and planarity. 149-153 - Henry H. Glover, John Philip Huneke:
Graphs with bounded valency that do not embed in the projective plane. 155-165 - R. C. Grimson:
Enumeration of dimer (domino) configurations. 167-177 - Tor Helleseth, Torleiv Kløve, Johannes Mykkeltveit:
The weight distribution of irreducible cyclic codes with block lengths n1((q1-1)/N). 179-211 - Allan B. Cruse:
A note on 1-factors in certain regular multigraphs. 213-216
Volume 18, Number 3, 1977
- Ronald Alter, Chung C. Wang:
Uniquely intersectable graphs. 217-226 - B. A. Anderson:
Symmetry groups of some perfect 1-factorizations of complete graphs. 227-234 - Jean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau:
Line graphs of hypergraphs I. 235-241 - Tom Brylawski:
Connected matroids with the smallest whitney numbers. 243-252 - G. F. Clements:
More on the generalized macaulay theorem - II. 253-264 - J. B. Collier, Edward F. Schmeichel:
New flip-flop construction for hypohamilton graphs. 265-271 - Jonathan L. Gross, Thomas W. Tucker:
Generating all graph coverings by permutation voltage assignments. 273-283 - Benjamin Kedem:
Counting the number of 0-1 stationary time series having the same likelihood. 285-289 - William B. Poucher:
Finite embedding theorems for partial pairwise balanced designs. 291-298 - J. M. S. Simões-Pereira:
A note on finite topologies and switching functions. 299-310 - Robert E. Bixby:
A simple proof that every matroid is an intersection of fundamental transversal matroids. 311-312
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 01:29 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:
