Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 4
Volume 4, Number 1, 1973
- Jacques Dubois:
Polytopes de transport symetriques. 1-27 - Paul Erdös, Patrik E. O'Neil:
On a generalization of Ramsey numbers. 29-35 - M. R. Garey:
Optimal task sequencing with precedence constraints. 37-56 - Alan G. Konheim, Donald J. Newman:
A note on growing binary trees. 57-63 - Anton Kotzig:
Decompositions of complete graphs into regular bichromatic factors. 65-69 - Phillip A. Ostrand:
Graphs with specified radius and diameter. 71-75 - Richard P. Stanley:
A Brylawski decomposition for finite ordered sets. 77-82 - Yves Tabourier:
All shortest distances in a graph. An improvement to Dantzig's inductive algorithm. 83-87 - Gerald Berman:
The gossip problem. 91
Volume 4, Number 2, February 1973
- S. Cardy:
The proof of, and generalisations to, a conjecture by Baker and Essam. 101-122 - G. F. Clements:
A minimization problem concerning subsets of a finite set. 123-128 - Curtis R. Cook:
Further characterizations of cubic lattice graphs. 129-138 - A. K. Dewdney:
Wagner's theorem for Torus graphs. 139-149 - Derek A. Holton:
Two applications of semi-stable graphs. 151-158 - Sukhamay Kundu, Eugene L. Lawler:
A matroid generalization of a theorem of Mendelsohn and Dulmage. 159-163 - David C. Kurtz:
Asymptotic properties of triangular arrays of numbers. 165-169 - C. L. Liu, B. G. Ong, Gregory R. Ruth:
A construction scheme for linear and non-linear codes. 171-184 - Henry Sharp Jr.:
Enumeration of vacuously transitive relations. 185-196
Volume 4, Number 3, March 1973
- Michael O. Albertson:
A case of hadwiger's conjecture. 197-199 - Amos Altshuler:
Construction and enumeration of regular maps on the torus. 201-217 - Mary Katherine Bennett:
Coordinatization of affine and projective space. 219-231 - Ronald V. Book:
Free and almost-free subsemigroups of a free semigroup. 233-241 - Janusz A. Brzozowski, Imre Simon:
Characterizations of locally testable events. 243-271 - L. Carlitz:
Enumeration of up-down sequences. 273-286 - David Sankoff, Peter H. Sellers:
Shortcuts, diversions, and maximal chainsin partially ordered sets. 287-293
Volume 4, Number 4, April 1973
- Yves Balcer, Arthur F. Veinott Jr.:
Computing a graph's period quadratically by node condensation. 295-303 - Vasek Chvátal:
Edmonds polytopes and a hierarchy of combinatorial problems. 305-337 - Vance Faber, Jan Mycielski:
Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth. 339-345 - Herbert Fleischner:
The uniquely embeddable planar graphs. 347-358 - Aviezri S. Fraenkel:
A characterization of exactly covering congruences. 359-366 - Robert G. Jeroslow:
The simplex algorithm with the pivot rule of maximizing criterion improvement. 367-377 - Judith Q. Longyear:
Large tactical configurations. 379-382 - John Riordan:
Ballots and rooks. 383-387 - Earl Glen Whitehead Jr.:
The ramsey number N(3, 3, 3, 3; 2). 389-396
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-07-18 22:00 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:
