Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 82
Volume 82, Number 1, May 1990
- Jacques Labelle, Yeong-Nan Yeh:
Generalized Dyck paths. 1-6 - Kiyoshi Ando, Severino Villanueva Gervacio, Mikio Kano:
Disjoint subsets of integers having a constant sum. 7-11 - Khee Meng Koh, B. H. Goh:
Two classes of chromatically unique graphs. 13-24 - Hao Li:
Edge-hamiltonian property in regular 2- connected graphs. 25-34 - James G. Oxley:
On an excluded-minor class of matroids. 35-52 - Michael Reid, Douglas S. Jungreis, Dave Witte:
Distances forbidden by some two-coloring of Q2. 53-56 - Saul Stahl:
Region distributions of graph embeddings and stirling numbers. 57-78 - Manfred Stern:
Strongness in semimodular lattices. 79-88 - Doron Zeilberger:
A bijection from ordered trees to binary trees that sends the pruning order to the strahler number. 89-92 - Oskar Goecke, Rainer Schrader:
Minor characterization of undirected branching greedoids - a short proof. 93-99 - Rafal Kalinowski, Zdzislaw Skupien:
Large Isaacs' graphs are maximally non- Hamilton-connected. 101-104 - Edward R. Scheinerman:
On the interval number of random graphs. 105-109
Volume 82, Number 2, June 1990
- Brian Alspach, Stephen C. Locke
, Dave Witte:
The hamilton spaces of cayley graphs on abelian groups. 113-126 - Sharon Cabaniss, Bradley W. Jackson:
Infinite families of bi-embeddings. 127-141 - Mao-cheng Cai:
Restricted covering of digraphs with arborescences. 143-152 - Leonard S. Charlap, Howard D. Rees, David P. Robbins:
The asymptotic probability that a random biased matrix is invertible. 153-163 - Rossana Chiavacci, Giuseppe Pareschi:
Some bounds for the regular genus of PL-manifolds. 165-180 - Klaus G. Fischer:
Additive K-colorable extensions of the rational plane. 181-195 - Michael Plantholt, Shailesh K. Tipnis:
The chromatic index of multigraphs that are nearly full. 197-207 - Gek Ling Chia:
The chromaticity of wheels with a missing spoke. 209-212 - Wenceslas Fernandez de la Vega:
Kernels in random graphs. 213-217 - Mikio Kano, Akio Sakamoto:
Spanning trees fixed by automorphisms of a graph. 219-222
Volume 82, Number 3, June 1990
- Izak Broere, Marietjie Frick:
On the order of uniquely (k, m)-colourable graphs. 225-232 - Jurek Czyzowicz, Andrzej Pelc, Ivan Rival:
Drawing orders with few slopes. 233-250 - David C. Fisher, Anita E. Solow:
Dependence polynomials. 251-258 - Mark D. Halsey:
Extensions of line-closed combinatorial geometries. 259-262 - Hans Kurzweil:
A combinatorial technique for simplicial complexes and some applications to finite groups. 263-278 - Gaetano Quattrocchi:
On the intersection of two S(3, 4, 2upsilon) having a same derived triple system. 279-286 - Edward R. Scheinerman:
An evolution of interval graphs. 287-302 - Lewis E. Varga:
Geometric matrices and an inequality for (0, 1)-matrices. 303-315 - Frans C. Bussemaker, Vladimir D. Tonchev:
Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20. 317-321 - Yair Caro, Yehuda Roditty:
A note on packing trees into complete bipartite graphs and on fishburn's conjecture. 323-326 - Gena Hahn, Bill Jackson:
A note concerning paths and independence number in digraphs. 327-329 - Iwao Sato:
Enumeration of packed graphs. 331-333
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-10 18:48 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:
