Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 5
Volume 5, Number 1, May 1973
- Alexander R. Bednarek, E. L. Sanders:
A characterization of bivariegated trees. 1-14 - Lowell W. Beineke, Robin J. Wilson:
On the edge-chromatic number of a graph. 15-20 - Kenneth P. Bogart:
Maximal dimensional partially ordered sets I. Hiraguchi's theorem. 21-31 - Kenneth P. Bogart, William T. Trotter:
Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n. 33-43 - L. Carlitz, Richard Scoville:
Enumeration of rises and falls by position. 45-59 - Jacques Dubois:
Transformations affines agissant sur un simplexe. 61-78 - Charles C. Lindner:
Construction of doubly diagonalized orthogonal latin squares. 79-86 - Romano Scozzafava:
Graphs and finite transformation semigroups. 87-99 - László Babai
, Wilfried Imrich:
On groups of polyhedral graphs. 101-103
Volume 5, Number 2, 1973
- John J. Cannon:
Construction of defining relators for finite groups. 105-129 - Gabor T. Herman, Janice A. Jackowski:
A decision procedure using discrete geometry. 131-144 - Jean-Loup Jolivet:
Sur le joint d'une famille de graphes. 145-158 - W. H. Olson, V. R. R. Uppuluri:
On 'valid sequences' considered by Wigner. 159-169 - Richard P. Stanley:
Acyclic orientations of graphs. 171-178 - David P. Sumner:
Point determination in graphs. 179-187
Volume 5, Number 3, July 1973
- J. C. Arditti:
Denombrement des arborescences dont le graphe de comparabilite est hamiltonien. 189-200 - Nechemia Burshtein:
On distinct unit fractions whose sum equals 1. 201-206 - C. C. Chen, Khee Meng Koh:
A characterization of finite distributive planar lattices. 207-213 - Vasek Chvátal:
Tough graphs and hamiltonian circuits. 215-228 - Jean Doyen, Richard M. Wilson:
Embeddings of Steiner triple systems. 229-239 - Branko Grünbaum:
Intersecting all edges of centrally symmetric polyhedra by planes. 241-246 - Thomas M. Hearne, Carl G. Wagner:
Minimal covers of finite sets. 247-251 - Hudson V. Kronk, John Mitchem:
A seven-color theorem on the sphere. 253-260 - Ismail Burhan Türksen:
The set of solutions for Boolean equations. 261-282 - Mordechai Lewin:
A note on line coverings of graphs. 283-285 - Bernard Monjardet:
Hypergraphs and Sperner's theorem. 287-289
Volume 5, Number 4, August 1973
- William M. Boyce:
On a simple optimal stopping problem. 297-312 - Gary Chartrand, Seymour Schuster:
A note on cycle Ramsey numbers. 313-315 - Fan R. K. Chung:
On the ramsey numbers N(3, 3, ...3;2). 317-321 - Paul Erdös, Miklós Simonovits:
On a valence problem in extremal graph theory. 323-334 - Richard K. Guy, Anthony Hill:
The crossing number of the complement of a circuit. 335-344 - Michael J. L. Kirby, H. R. Love, Kanti Swarup:
Extreme point programming with nonlinear constraints. 345-365 - Donald E. Knuth:
Permutations with nonnegative partial sums. 367-371 - Andrew M. Odlyzko:
On covering a product of sets with products of their subsets. 373-380 - John Riordan, Paul R. Stein:
Proof of a conjecture on Genocchi numbers. 381-388 - Moshe Rosenfeld, David W. Barnette:
Hamiltonian circuits in certain prisms. 389-394 - R. R. Rottenberg:
On ordinary planes. 395-401
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-04 22:25 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:
