default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 27
Volume 27, Number 1, 1979
- A. Békéssy, János Demetrovics:
Contribution to the theory of data base relations. 1-10 - Robert G. Bland, H.-C. Huang, Leslie E. Trotter Jr.:
Graphical properties related to minimal imperfection. 11-22 - Robert W. Deming:
Independence numbers of graphs-an extension of the Koenig-Egervary theorem. 23-33 - Walter A. Deuber:
Partition theorems for unary algebras. 35-45 - William H. Gates, Christos H. Papadimitriou:
Bounds for sorting by prefix reversal. 47-57 - Meir Katchalski, A. Liu:
Arcs on the circle and p-tuplets on the line. 59-69 - Charles Payan, Nguyen Huy Xuong:
Upper embeddability and connectivity of graphs. 71-80 - Douglas G. Rogers:
The enumeration of some restricted matrices. 81-91 - Rüdiger Schmidt:
On the existence of uncountably many matroidal families. 93-97 - Douglas B. West, Daniel J. Kleitman:
Skew chain orders and sets of rectangles. 99-102 - Marc Snir:
The covering problem of complete uniform hypergraphs. 103-105 - Alexandru Filipoiu:
Representation theorems for Lukasiewicz algebras. 107-110
Volume 27, Number 2, 1979
- B. Devadas Acharya:
On the cyclomatic number of a hypergraph. 111-116 - Russell Belding:
Structures characterizing partially ordered sets, and their automorphism groups. 117-126 - Richard A. Brualdi:
The diagonal hypergraph of a matrix (bipartite graph). 127-147 - Paul A. Catlin:
Subgraphs with triangular components. 149-170 - Chong-Yun Chao, Earl Glen Whitehead Jr.:
Chromatically unique graphs. 171-177 - Charalambos A. Charalambides:
A problem of arrangements on chessboards and generalizations. 179-186 - Philippe Delsarte:
A generalization of the Legendre symbol for finite Abelian groups. 187-192 - C. W. Evans:
Net structure and cages. 193-204 - F. Sterboul:
Smallest 3-graphs having a 3-colored edge in every k-coloring. 205-210 - James Wildon Fickett:
High valency subgraphs of cubes. 211-212 - Brendan D. McKay:
Hadamard equivalence via graph isomorphism. 213-214
Volume 27, Number 3, December 1979
- David K. Arrowsmith, Michael A. A. Cox, John W. Essam:
The family of D-weights for a two-rooted graph. 215-223 - Mouloud Boulala, Jean-Pierre Uhry:
Polytope des independants d'un graphe serie-parallele. 225-243 - Joseph A. Gallian, David J. Rusin:
Cyclotomic polynomials and nonstandard dice. 245-259 - Charlotte Huang, Anton Kotzig, Alexander Rosa:
On a variation of the Oberwolfach problem. 261-277 - Germain Kreweras:
Sur les extensions lineaires d'une famille particuliere d'ordres partiels. 279-295 - Aldo de Luca, Dominique Perrin, Antonio Restivo, Settimo Termini:
Synchronization and simplification. 297-308 - Dominique de Werra:
Regular and canonical colorings. 309-316 - Walter Wyss:
Quasi-multiplication and polynomial sequences. 317-330 - François Jaeger:
Interval matroids and graphs. 331-336
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-10-31 20:18 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:
