![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Discrete Mathematics, Volume 105
Volume 105, Numbers 1-3, August 1992
- Gerhard Behrendt:
Automorphism groups of posets with forbidden subposets. 1-11 - Alberto Del Fra, Dina Ghinelli:
Classification of extended generalized quadrangles with maximum diameter. 13-23 - John D. Dixon:
Random sets which invariably generate the symmetric group. 25-39 - Robert James Douglas:
NP-completeness and degree restricted spanning trees. 41-47 - Marcel Erné:
The number of partially ordered sets with more points than incomparable pairs. 49-60 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Neighborhood unions and a generalization of Dirac's theorem. 61-71 - Jean Fonlupt, Ali Ridha Mahjoub, J. P. Uhry:
Compositions in the bipartite subgraph polytope. 73-91 - Chính T. Hoàng, Frédéric Maffray:
On slim graphs, even pairs, and star-cutsets. 93-102 - Zygmunt Jackowski:
A new characterization of proper interval graphs. 103-109 - Kenneth W. Johnson:
Latin square determinants II. 111-130 - Jin Ho Kwak, Jaeun Lee:
Isomorphism classes of cycle permutation graphs. 131-142 - Daniel E. Loeb:
A generalization of the binomial coefficients. 143-156 - Yannis Manoussakis, Denise Amar:
Hamiltonian paths and cycles, number of arcs and independence number in digraphs. 157-172 - James G. Oxley, Geoff Whittle:
Connectivity of submodular functions. 173-184 - Andrzej Rucinski
:
Matching and covering the vertices of a random graph by copies of a given graph. 185-197 - Randell A. Stevenson:
Dilworth truncations and k-induced matroids. 199-205 - Douglas R. Stinson, Y. J. Wei:
Some results on quadrilaterals in Steiner triple systems. 207-219 - Evelyn L. Tan:
Some notes on cycle graphs. 221-226 - Stephen M. Tanny:
A well-behaved cousin of the Hofstadter sequence. 227-239 - Ioan Tomescu
:
Ordered h-hypertrees. 241-248 - Takao Ueda:
Circular nonsingular threshold transformations. 249-258 - Piotr Wójcik:
Density of union-closed families. 259-267 - Douglas R. Woodall:
Cycle lengths and circuit matroids of graphs. 269-273 - Xingxing Yu:
Cyclomatic numbers of connected induced subgraphs. 275-284 - Fuji Zhang, Xiaofeng Guo:
Reducible chains in several types of 2-connected graphs. 285-291 - Igor E. Zverovich, Vadim E. Zverovich:
Contributions to the theory of graphic sequences. 293-303 - Martin Baca
:
On magic labelings of honeycomb. 305-311 - Jyrki T. Lahtonen:
An optimal polynomial for a covering radius problem. 313-317 - V. I. Rodionov:
On the number of labeled acyclic digraphs. 319-321 - Xiang-Ying Su:
A result on decompositions of regular graphs. 323-326
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.