default search action
Discrete Mathematics, Volume 10
Volume 10, Number 1, 1974
- Alphonse Baartmans, Kenneth J. Danhof:
Block designs admitting regular automorphisms. 1-8 - David W. Barnette:
An upper bound for the diameter of a polytope. 9-13 - R. S. Booth:
A class of Fibonacci-type sequences. 15-28 - Charles R. Deeter, J. Michael Gray:
The discrete Green's function and the discrete kernel function. 29-42 - Roger C. Entringer, Larry D. Gassman:
Line-critical point determining and point distinguishing graphs. 43-55 - Michel Fliess:
Transductions de series formelles. 57-74 - William H. Graves:
Cohomology of incidence coalgebras. 75-92 - Branko Grünbaum, Joseph Zaks:
The existence of certain planar maps. 93-115 - T. King, George L. Nemhauser:
Some inequalities on the chromatic number of a graph. 117-121 - Earl S. Kramer, Dale M. Mesner:
On Steiner tableaus. 123-131 - Carlton J. Maxson:
Endomorphism semigroups of finite subset algebras. 133-144 - Stanley E. Payne:
On maximizing det (ATA). 145-158 - Arnon Rosenthal:
On finding shortest paths in nonnegative networks. 159-162 - William Simons, George Trapp:
Separating points by spheres. 163-166 - D. H. Smith:
On bipartite tetravalent graphs. 167-172 - Ioan Tomescu:
La reduction minimale d'un graphe a une reunion de cliques. 173-179 - Willibald Dörfler:
Every regular graph is a quasigroup graph. 181-183 - Ervin Gergely:
A remark on doubly diagonalized orthogonal Latin squares. 185-188 - Detlef Wille:
On the enumeration of self-complementary m-placed relations. 189-192
Volume 10, Number 2, 1974
- Leonard M. Adleman:
Short permutation strings. 197-200 - David W. Barnette:
The projection of the f-vectors of 4-polytopes onto the (E, S)-plane. 201-216 - Edward A. Bender:
The asymptotic number of non-negative integer matrices with given row and column sums. 217-223 - Paul A. Catlin:
Subgraphs of graphs, I. 225-233 - G. F. Clements:
Sperner's theorem with constraints. 235-255 - Daniel R. Farkas:
Radicals and primes in incidence algebras. 257-268 - Ralph J. Faudree, S. L. Lawrence, Torrence D. Parsons, Richard H. Schelp:
Path-cycle Ramsey numbers. 269-277 - Roy C. Olson:
On the six conics problem. 279-300 - Robert W. Quackenbush:
Near-boolean algebras I: Combinatorial aspects. 301-308 - David C. Rine:
Conditional and post algebra expressions. 309-323 - Ivo G. Rosenberg:
Aggregation of equations in integer programming. 325-341 - J. Rosenmüller, H. G. Weidner:
Extreme convex set functions with finite carrier: General theory. 343-382 - Carsten Thomassen:
On hypohamiltonian graphs. 383-390 - Donald W. VanderJagt:
Graphs with prescribed local connectivities. 391-395 - Bernhard Ganter:
Finite partial quadruple systems can be finitely embedded. 397-400 - Damaraju Raghavarao:
Boolean sums of sets of certain designs. 401-403
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.