default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 24
Volume 24, Number 1, 1978
- Paul A. Catlin:
Another bound on the chromatic number of a graph. 1-6 - Ashok K. Chandra, George Markowsky:
On the number of prime implicants. 7-11 - John R. Isbell:
Perfect addition sets. 13-18 - Gerard Lallement:
Cyclotomic polynomials and unions of groups. 19-36 - Shuo-Yen Robert Li:
Extremal theorems on divisors of a number. 37-46 - Laurence R. Matthews:
Matroids from directed graphs. 47-61 - Henry D. Shapiro:
Generalized Latin squares on the torus. 63-77 - K. Vidyasankar:
Covering the edge set of a directed graph with trees. 79-85 - Carl G. Wagner:
Minimal multiplicative covers of an integer. 87-94 - Da-Lun Wang, Ping Wang:
Some results about the Chvátal conjecture. 95-101 - Stephane Foldes, G. Gabor:
Note on discrete random walks. 103-104 - Martin Charles Golumbic:
Trivially perfect graphs. 105-107 - Charles C. Lindner, Kevin T. Phelps:
A Note on Partial Parallel Classes in Steiner Systems. 109-112
Volume 24, Number 2, 1978
- Renu C. Laskar, Bruce Auerbach:
On complementary graphs with no isolated vertices. 113-118 - László Babai
:
Vector representable matroids of given rank with given automorphism group. 119-125 - J. Beck:
On 3-chromatic hypergraphs. 127-137 - Frank E. Benneit:
Extended cyclic triple systems. 139-146 - Charles E. Blair:
Minimal inequalities for mixed integer programs. 147-151 - Marilyn Breen:
A better decomposition theorem for simply connected m-convex sets. 153-159 - Fred Galvin, G. Hesse, Karsten Steffens:
On the number of automorphisms of structures. 161-166 - Dennis P. Geoffroy:
On 1-factors of point determining graphs. 167-175 - Mark G. Karpovsky, V. D. Milman:
Coordinate density of sets of vectors. 177-184 - Stephen B. Maurer, Peter J. Slater:
On k-minimally n-edge-connected graphs. 185-195 - Martyn Mulder:
The structure of median graphs. 197-204 - B. David Saunders, Hans Schneider:
Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices. 205-220 - András Gyárfás:
A note on hypergraphs with the Helly-property. 221-223 - Maurice Pouzet:
Sur certains tournois reconstructibles application a leurs groupes d'automorphismes. 225-229 - Carsten Thomassen:
Reconstructibility versus edge reconstructibility of infinite graphs. 231-233
Volume 24, Number 3, 1978
- Paul Erdös, Stephen H. Hechler, Paul C. Kainen:
On finite superuniversal graphs. 235-249 - Marsha F. Foregger:
Hamiltonian decompositions of products of cycles. 251-260 - Dirk Hausmann, Bernhard Korte:
Lower bounds on the worst-case complexity of some oracle algorithms. 261-276 - Sandra L. Mitchell:
Another characterization of the centroid of a tree. 277-280 - Hien Q. Nguyen:
Projections and weak maps in combinatorial geometries. 281-289 - G. Ravindra:
Perfectness of normal products of graphs. 291-298 - Stephen M. Tanny, Michael Zuker:
Analytic methods applied to a sequence of binomial coefficients. 299-310 - Béla Bollobás:
Chromatic number, girth and maximal degree. 311-314 - Paul D. Seymour:
Counterexample to a conjecture of Jeurissen. 315
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-15 19:22 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:
