default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 21
Volume 21, Number 1, 1978
- János Demetrovics:
On the main diagonal of sheffer functions. 1-5 - Peter C. Fishburn:
Operations on binary relations. 7-22 - John D. Fulton:
Generalized inverses of matrices over a finite field. 23-29 - Louise Hay:
Convex subsets of 2n and bounded truth-table reducibility. 31-46 - Melvin F. Janowitz:
Semiflat L-cluster methods. 47-60 - Jim Lawrence:
Covering the vertex set of a graph with subgraphs of smaller degree. 61-68 - C. H. C. Little, Richard D. Ringeisen:
An additivity theorem for maximum genus of a graph. 69-74 - Gadi Moran:
Some coefficients in the center of the group algebra of the symmetric group. 75-81
- Kenneth A. Berman:
Directed faces in planar digraphs and unicoloured faces in edge 2-coloured planar Eulerian maps. 83-85 - Robert E. Bixby:
The solution to a matroid problem of Knuth. 87-88 - Ian F. Blake, J. J. Stiffler:
A note on generalized Room squares. 89-93
Volume 21, Number 2, 1978
- R. C. Bose, William G. Bridges, Mohan S. Shrikhande:
Partial geometric designs and two-class partially balanced designs. 97-101 - Paolo M. Camerini, Francesco Maffioli:
Heuristically guided algorithm for k-parity matroid problems. 103-116 - K. M. Chung, C. L. Liu:
A generalization of Ramsey theory for graphs. 117-127 - Ernest J. Cockayne, Bert L. Hartnell, Stephen T. Hedetniemi:
A linear algorithm for disjoint matchings in trees. 129-136 - H. O. Foulkes:
Recurrences for characters of the symmetric group. 137-144 - Dennis P. Geoffroy:
Nuclei for totally point determining graphs. 145-162 - Margaret J. Hodel:
Enumeration of rectangular arrays of zeros and ones. 163-176 - Sanpei Kageyama:
Improved inequalities for balanced incomplete block designs. 177-188 - Christopher Landauer:
Lloyd's theorem for perfect codes. 189-200 - M. Sakarovitch:
Quelques theoremes de dualite combinatoire. 201-212 - John Mitchem:
A short proof of Catlin's extension of Brooks' theorem. 213-214 - Hiroshi Narushima, Hiroshi Era:
A variant of inclusion-exclusion on semilattices. 215-217 - Arthur D. Sands:
On generalised catalan numbers. 219-221
Volume 21, Number 3, 1978
- Claude Flament:
Hypergraphes arbores. 223-227 - P. R. Goodey, M. Rosenfeld:
Hamiltonian circuits in prisms over certain simple 3-polytopes. 229-235 - Jan van Leeuwen:
Effective constructions in well-partially- ordered free monoids. 237-252 - Witold Lipski Jr.:
On strings containing all subsets as substrings. 253-259 - Zevi Miller:
Contractions of graphs: A theorem of ore and an extremal problem. 261-272 - Hien Q. Nguyen:
n-Alternation deficiency of geometric rank-functions. 273-283 - P. A. Picon:
Sur certaines suites récurrentes cubiques ayant deux ou trois termes nuls. 285-296 - Hans Joachim Schmid:
A geometrical interpretation of the Hungarian method. 297-308 - P. R. Stein, C. J. Everett:
On a class of linked diagrams II. asymptotics. 309-318 - Adalbert Kerber:
A matrix of combinatorial numbers related to the symmetric groups. 319-321 - P. Underground:
On graphs with hamiltonian squares. 323
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-25 22:46 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:
