Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 26
Volume 26, Number 1, 1979
- Gerd Blind:
Decomposition of a convex polygon into convex polygons. 1-15 - Joseph G. Deken:
Some limit results for longest common subsequences. 17-31 - Harold N. Gabow:
Algorithmic proofs of two relations between connectivity and the 1-factors of a graph. 33-40 - Basil Gordon, Lorne Houten:
Notes on plane partitions VI. 41-45 - Maciej M. Syslo:
Characterizations of outerplanar graphs. 47-53 - Ahnont Wongseelashote:
Semirings and path spaces. 55-78
Volume 26, Number 2, 1979
- Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides:
Combinatorial designs related to the strong perfect graph conjecture. 83-92 - Frank W. Barnes:
Packing the maximum number of m × n tiles in a large p × q rectangle. 93-100 - Andrzej Ehrenfeucht, D. M. Silberger:
Periodicity and unbordered segments of words. 101-109 - Peter Frankl:
Families of finite sets satisfying a union condition. 111-118 - B. R. Handa, Sri Gopal Mohanty:
Enumeration of higher-dimensional paths under restrictions. 119-128 - W. Cary Huffman:
The biweight enumerator of self-orthogonal binary codes. 129-143 - S. A. Joni:
The multi-indexed partitional. 145-163 - Vladimír Müller:
On colorings of graphs without short cycles. 165-176 - Alexander Schrijver, Paul D. Seymour
:
Solution of two fractional packing problems of lovász. 177-184 - Harold N. Ward:
Combinatorial polarization. 185-197
Volume 26, Number 3, 1979
- Jin Akiyama, Takashi Hamada:
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests. 203-208 - Izak Broere, Christina M. Mynhardt:
Remarks on the critical graph conjecture. 209-212 - Raul Cordovil, Michel Las Vergnas:
Geometries simpliciales unimodulaires. 213-217 - Rick Giles, Dirk Hausmann:
Characterizations of adjacency on the branching polyhedron. 219-226 - Yahya Ould Hamidoune:
Sur les parcours hamiltoniens dans les graphes orientes. 227-234 - Frank Harary, Helene J. Kommel:
The graphs with only self-dual signings. 235-241 - I. J. Holyer, Ernest J. Cockayne:
On the sum of cardinalities of extremum maximal independent sets. 243-246 - Christopher J. Mitchell:
An infinite family of symmetric designs. 247-250 - John W. Moon:
Some enumeration problems for similarity relations. 251-260 - P. R. Stein, Michael S. Waterman:
On some new sequences generalizing the Catalan and Motzkin numbers. 261-272 - Michael Tarsi:
Decomposition of complete multigraphs into stars. 273-278 - Gérard Viennot:
Permutations ayant une forme donnee. 279-284 - Andrew Wohlgemuth:
Labeled reaction matrices, a histocompatibility model. 285-292 - Takao Ueda:
On the fixing group for a totally pre-ordered Boolean function. 293-295 - Hansjoachim Walther:
Remark on a paper of J. Zaks. 297-301
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-04-17 21:32 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:
