Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 69
Volume 69, Number 1, March 1988
- Ian Anderson:
An Erdös-Ko-Rado theorem for multisets. 1-9 - Achim Bachem, Walter Kern:
On sticky matroids. 11-18 - Mark N. Ellingham:
Isomorphic factorization of r-regular graphs into r parts. 19-34 - András Gyárfás, Michael S. Jacobson, Lael F. Kinch:
On a generalization of transitivity for digraphs. 35-41 - Hong-Jian Lai:
On the Hamiltonian index. 43-53 - Guizhen Liu:
A lower bound on connectivities of matroid base graphs. 55-60 - Francesco M. Malvestuto:
Existence of extensions and product extensions for discrete probability distributions. 61-77 - Gary L. Mullen:
Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order. 79-84 - Bing Zhou:
The maximum number of cycles in the complement of a tree. 85-94 - Zsolt Tuza:
Isomorphism of two infinite-chromatic triangle-free graphs. 95 - Robert Grone, Russell Merris:
A bound for the complexity of a simple graph. 97-99 - Friedrich Otto:
An example of a one-relator group that is not a one-relation monoid. 101-103
Volume 69, Number 2, April 1988
- Abraham Berman, Anton Kotzig:
Cross-cloning and antipodal graphs. 107-114 - Larry J. Brant, Gary L. Mullen:
A study of frequency cubes. 115-121 - Thomas H. Brylawski, Elaine Dieter:
Exchange systems. 123-151 - G. F. Clements:
On multiset k-families. 153-164 - Michele Conforti, Monique Laurent:
A characterization of matroidal systems of inequalities. 165-171 - Victor Neumann-Lara, Jorge Urrutia:
A combinatorial result on points and circles on the plane. 173-178 - Erwin Pesch:
Products of absolute retracts. 179-188 - Shao-Ji Xu:
On sigma-polynomials. 189-194 - Robert R. Korfhage:
A note on quadratic sigma-polynomials. 195-196 - Hartmut Laue:
A graph theoretic proof of the fundamental trace identity. 197-198 - Chengde Wang:
On the sum of two parameters concerning independence and irredundance in a graph. 199-202 - David C. Fisher:
The number of triangles in a K4-free graph. 203-205 - Hortensia Galeana-Sánchez:
A new method to extend kernel-perfect graphs to kernel-perfect critical graphs. 207-209 - A. F. Sidorenko:
An infinite permutation without arithmetic progressions. 211
Volume 69, Number 3, May 1988
- Kiran B. Chilakamarri:
Unit-distance graphs in rational n-spaces. 213-218 - Graham Farr:
The complexity of multicolouring. 219-223 - Klaus G. Fischer:
Symmetric polynomials and Hall's theorem. 225-234 - Jennifer D. Key, N. K. A. Rostom:
Unitary designs with regular sets of points. 235-239 - Khee Meng Koh, K. S. Poh:
Products of graphs with their closed-set lattices. 241-251 - P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone:
Adamant digraphs. 253-261 - Rudolf Mathon:
On self-complementary strongly regular graphs. 263-281 - Hirobumi Mizuno, Iwao Sato:
Ramsey numbers for unions of some cycles. 283-294 - Grattan Murphy, Ren Ding:
Grünbaum's gap conjecture. 295-300 - Ortrud R. Oellermann:
The connected cutset connectivity of a graph. 301-308 - Anthony J. W. Hilton, Peter D. Johnson Jr.:
Reverse class critical multigraphs. 309-311 - Yongcai Liu:
Construction and counting or generalized Boolean functions. 313-316 - Ronald C. Read:
A note on the chromatic uniqueness of W10. 317
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-25 05:29 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:
