default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 103
Volume 103, Number 1, May 1992
- Hans-Jürgen Bandelt:
Graphs with edge-preserving majority functions. 1-5 - James A. Davis:
Construction of relative difference sets in p-groups. 7-15 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Terri Lindquester:
On independent generalized degrees and independence numbers in K(1, m)-free graphs. 17-24 - Peter C. Fishburn, William T. Trotter:
Linear extensions of semiorders: a maximization problem. 25-40 - András Gyárfás:
Graphs with k odd cycle lengths. 41-48 - Louis Kauffman, Sóstenes Lins:
Decomposition of the vertex group of 3-manifolds. 49-55 - Norbert Polat:
A minimax theorem for infinite graphs with ideal points. 57-65 - Nigel Ray, Colin Wright:
Umbral interpolation and the addition/contraction tree for graphs. 67-74 - Mieko Yamada:
Supplementary difference sets and Jacobi sums. 75-90 - James D. Currie:
Connectivity of distance graphs. 91-94 - William McCuaig:
Cycles through edges in cyclically k-connected cubic graphs. 95-98 - Jean Marcel Pallo:
Une bijection entre arbres binaires et certaines matrices de Jacobi. 99-101 - Michal Tkác
:
Shortness coefficients of simple 3-polytopal graphs with edges of only two types. 103-110
Volume 103, Number 2, May 1992
- Noga Alon, Daniel J. Kleitman:
Partitioning a rectangle into small perimeter rectangles. 111-119 - Ahmed M. Assaf, Alan Hartman, Nabil Shalaby:
Packing designs with block size 6 and index 5. 121-128 - Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, J. Yin, Lie Zhu:
Existence of perfect Mendelsohn designs with k=5 and lambda>1. 129-137 - Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, Lie Zhu:
Constructions of perfect Mendelsohn designs. 139-151 - John G. Del Greco:
Characterizing bias matroids. 153-159 - Anthony D. Gardiner, Chris D. Godsil, A. D. Hensel, Gordon F. Royle:
Second neighbourhoods of strongly regular graphs. 161-170 - Yahya Ould Hamidoune:
On a subgroup contained in some words with a bounded length. 171-176 - G. W. Peck, Aditya Shastri:
Bandwidth of theta graphs with short paths. 177-187 - Pascal Préa:
Graphs and topologies on discrete sets. 189-197 - Erich Prisner:
Convergence of iterated clique graphs. 199-207 - Qinglin Yu:
Classifying 2-extendable generalized Petersen graphs. 209-220
Volume 103, Number 3, May 1992
- Safwan Akkari:
A minimal 3-connectedness result for matroids. 221-232 - Zoltán Füredi, Péter Hajnal:
Davenport-Schinzel theory of matrices. 233-251 - A. Gardiner:
Almost rank three graphs. 253-257 - Daniel E. Loeb:
A generalization of the Stirling numbers. 259-269 - Charles Payan:
On the chromatic number of cube-like graphs. 271-277 - Ron M. Roth, Abraham Lempel:
t-sum generators of finite Abelian groups. 279-292 - László A. Székely, Lane H. Clark, Roger C. Entringer:
An inequality for degree sequences. 293-300 - Miroslaw Truszczynski, Zsolt Tuza:
Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets. 301-312 - David C. Fisher, Jennifer Ryan:
Bounds on the number of complete subgraphs. 313-320 - Julie Haviland, Andrew Thomason:
On testing the 'pseudo-randomness' of a hypergraph. 321-327
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-04 20:33 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:
