


default search action
Discrete Mathematics, Volume 7
Volume 7, Numbers 1-2, 1974
- Harold Brown, Larry Hjelmeland, Larry Masinter:

Constructive graph labeling using double cosets. 1-30 - V. Chungphaisan:

Conditions for sequences to be r-graphic. 31-39 - C. H. Cunkle, Sergiu Rudeanu:

Rings in boolean algebras. 41-51 - Roger B. Eggleton:

Tiling the plane with triangles. 53-65 - G. B. Faulkner, D. H. Younger:

Non-hamiltonian cubic planar maps. 67-74 - J. C. Fisher:

An existence theorem for simple convex polyhedra. 75-97 - J.-C. Fournier, Michel Las Vergnas:

Une classe d'hypergraphes bichromatiques II. 99-106 - Ralph Freese:

An application of dilworth's lattice of maximal antichains. 107-109 - Anthony J. W. Hilton, S. H. Scott:

A further construction of double diagonal orthogonal latin squares. 111-127 - F. Lapscher:

Proprietes De "Longueur De Chaine" Dans L'ensemble Des Fermetures Superieures Sur Un Ensemble Ordonne. 129-140 - André Lentin:

Une Propriete Combinatoire Des Couples De Permutations. 141-149 - Ivo G. Rosenberg:

Minimization of pseudo-boolean functions by binary development. 151-165 - Alan Tucker:

Structure theorems for some circular-arc graphs. 167-195
Volume 7, Numbers 3-4, 1974
- David W. Barnette:

On generating planar graphs. 199-208 - T. A. Dowling, Douglas G. Kelly:

Elementary strong maps and transversal geometries. 209-224 - Floyd J. Gould, Jon W. Tolle:

A unified approach to complementarity in optimization. 225-271 - Robert G. Jeroslow:

On algorithms for discrete problems. 273-280 - Charles C. Lindner:

Construction of nonisomorphic reverse steiner quasigroups. 281-288 - Michael D. Plummer, Neil Robertson:

Path traversability in planar graphs. 289-303 - George B. Purdy:

Some external problems in geometry. 305-315 - Donald J. Rose:

On simple characterizations of k-trees. 317-322 - Grzegorz Rozenberg:

Dol sequences. 323-347 - Miklós Simonovits:

Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions. 349-376 - Bjarne Toft

:
On critical subgraphs of colour-critical graphs. 377-392 - Laurence A. Wolsey:

A number theoretic reformulation and decomposition method for integer programming. 393-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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














