Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 28
Volume 28, Number 1, 1979
- C. C. Chen:
On the structure of complete graphs without alternating cycles. 1-5 - Cloyd L. Ezell:
Observations on the construction of covers using permutation voltage assignments. 7-20 - Jean Françon, Gérard Viennot:
Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de Genocchi. 21-35 - Jerrold R. Griggs:
Extremal values of the interval number of a graph, II. 37-47 - Phil Hanlon:
The enumeration of bipartite graphs. 49-57 - Wolfgang Knapp:
On the distance distribution of homogeneous codes. 59-63 - David L. Russell:
Sums of products of terms from linear recurrence sequences. 65-79 - Sadao Saito, Takanori Hayasaka:
The Langford (4, n)-sequence: A trigonometric approach. 81-88 - Volker Strehl:
Alternating permutations and modified Ghandi-polynomials. 89-100 - Bernt Lindström:
Non-regular simplicial matroids. 101-102 - M. Lorea:
On matroidal families. 103-106 - Victor A. Zinoviev:
Letter to the editor. 107
Volume 28, Number 2, 1979
- B. A. Anderson, Kenneth B. Gross, Philip A. Leonard:
Some Howell designs of prime side. 113-134 - Michael D. Beeler, Patrick E. O'Neil:
Some new Van der Waerden numbers. 135-146 - J. Csima:
On the plane term rank of three dimensional matrices. 147-152 - Ulrich Faigle:
The greedy algorithm for partially ordered sets. 153-159 - Tor Helleseth:
The weight distribution of the coset leaders for some classes of codes with related parity-check matrices. 161-171 - Michael Klemm, Bernd Wagner:
A matrix of combinatorial numbers related to the symmetric groups. 173-177 - Martyn Mulder
:
(0, λ)-graphs and n-cubes. 179-188 - Robert W. Quackenbush:
Pseudovarieties of finite algebras isomorphic to bounded distributive lattices. 189-192 - John R. Reay:
Twelve general position points always form three intersecting tetrahedra. 193-199 - Christoph Schulz:
An invertable 3-diagram with 8 vertices. 201-205 - Herbert S. Shank:
The rational case of a matrix problem of Harrison. 207-212 - R. Srinivasan:
On some results of Takács in ballot problems. 213-218 - Ingo Wegener:
On separating systems whose elements are sets of at most k elements. 219-222
Volume 28, Number 3, 1979
- Louis Caccetta, Roland Häggkvist:
On diameter critical graphs. 223-229 - Karen Chase:
Sandwich semigroups of binary relations. 231-236 - Martin Charles Golumbic, Yehoshua Perl:
Generalized fibonacci maximum path graphs. 237-245 - Jerrold W. Grossman, Frank Harary, Maria M. Klawe:
Generalized ramsey theory for graphs, x: double stars. 247-254 - Takao Nishizeki, Ilker Baybars:
Lower bounds on the cardinality of the maximum matchings of planar graphs. 255-267 - Helmut Prodinger:
On a generalization of the dyck-language over a two letter alphabet. 269-276 - Helmut Prodinger, Friedrich J. Urbanek:
Infinite 0-1-sequences without long adjacent identical blocks. 277-289 - Siddani Bhaskara Rao:
The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs. 291-301 - William T. Trotter:
A characterization of robert's inequality for boxicity. 303-313 - David W. Walkup:
How many ways can a permutation be factored into two n-cycles? 315-319 - Béla Bollobás:
On graphs with equal edge connectivity and minimum degree. 321-323 - Frank M. Liang:
A short proof of the 3d distance theorem. 325-326 - James B. Shearer:
A simple counterexample to a conjecture of Rota. 327-330 - George B. Purdy, Thomas Strommer:
The maximal sizes of faces and vertices in an arrangement. 331-334
a service of 
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-05-09 23:47 CEST 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:
