default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 20
Volume 20, 1977
- Andries E. Brouwer, Alexander Schrijver, Haim Hanani:
Group divisible designs with block-size four. 1-10 - András Frank:
On a class of balanced hypergraphs. 11-20 - Tor Helleseth:
The weight enumerator polynomials of some classes of codes with composite parity-check polynomials. 21-31 - Joan E. Herman, Fan R. K. Chung:
Some results on hook lengths. 33-40 - Mark Jungerman:
l-Regular rotations of the countably infinite complete graph. 41-49 - Michel Las Vergnas:
Acyclic and totally cyclic orientations of combinatorial geometries. 51-61 - N. S. Mendelsohn:
Perfect cyclic designs. 63-68 - Joel Spencer:
Asymptotic lower bounds for Ramsey functions. 69-76 - Takao Ueda:
The fixing groups for the 2-asummable Boolean functions. 77-82 - Béla Bollobás:
Semi-topological subgraphs. 83-85 - Torleiv Kløve:
The weight distribution for a class of irreducible cyclic codes. 87-90 - Earl S. Kramer:
A generalized room square GRS(4, 24) of dimension 9. 91-92 - Vasanti N. Bhat-Nayak, Ranjan N. Naik, S. B. Rao:
Frequency partitions: forcibly pancyclic and forcibly nonhamiltonian degree sequences. 93-102 - H. Burkill, L. Mirsky:
Combinatorial problems on the existence of large submatrices II. 103-108 - Clement W. H. Lam:
The distribution of 1-widths of (0, 1)-matrices. 109-122 - Charles C. Lindner, Eric Mendelsohn:
On the conjugates of an n2 × 4 orthogonal array. 123-132 - J. D. MacAllister, M. Sakarovitch:
Classification de certaines matrices 0-1. 133-142 - Hien Quang Nguyen:
Functions of the category of combinatorial geometries and strong maps. 143-158 - Ales Pultr
, Jirí Vinárek:
Productive classes and subdirect irreducibility, in particular for graphs. 159-176 - G. Ravindra, K. R. Parthasarathy:
Perfect product graphs. 177-186 - Philippe Vincke:
Quasi-kernels of minimum weakness in a graph. 187-192 - Mieczyslaw Wojtas:
On seven mutually orthogonal Latin squares. 193-201 - L. S. Mel'nikov, Richard Steinberg:
One counterexample for two conjectures on three coloring. 203-206 - J. C. Parnami, K. C. Prasad:
Enumeration of alternating sequences. 207-208 - V. A. Aksionov:
On uniquely 3-colorable planar graphs. 209-216 - Trevor I. Fenner, Georghios Loizou:
Combinatorial aspects of rectangular non-negative matrices. 217-234 - Branko Grünbaum, Geoffrey C. Shephard:
Perfect colorings of transitive tilings and patterns in the plane. 235-247 - Anton Kotzig, Jean M. Turgeon:
Regular perfect systems of differences sets. 249-254 - Stephen B. Maurer, Peter J. Slater:
On k-critical, n-connected graphs. 255-262 - Uri N. Peled:
Matroidal graphs. 263-286 - Gerhard Ringel:
On the genus of the graph Kn × K2 or the n-prism. 287-294 - Denis Hanson, J. Hanson:
Sum-free sets and ramsey numbers II. 295-296 - Henner Kröger:
Distributive lattices as a generalization of Brouwerian lattices. 297-299
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 2024-11-08 20:20 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:
