default search action
Discrete Mathematics, Volume 16
Volume 16, Number 1, September 1976
- R. C. Bose, William G. Bridges, Mohan S. Shrikhande:
A characterization of partial geometric designs. 1-7 - Dennis P. Geller:
r-tuple colorings of uniquely colorable graphs. 9-12 - Guy Giraud:
Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des arêtes du n-emble. 13-38 - Toshimde Ibaraki:
Integer programming formulation of combinatorial optimization problems. 39-52 - Günther Pabst:
Quantitative axioms for finite affine planes. 53-56 - E. Sampathkumar
, V. N. Bhave:
Partition graphs and coloring numbers of a graph. 57-60 - Michael J. Todd:
Characterizing binary simplical matroids. 61-70 - William T. Trotter, Kenneth P. Bogart:
On the complexity of posets. 71-82 - Stefan Znám:
On existence and regularity of graphs with certain properties. 83-90
Volume 16, Number 2, October 1976
- Amos Altshuler, Leon Steinberg:
An enumeration of combinatorial 3-manifolds with nine vertices. 91-108 - Lowell W. Beineke, Stanley Fiorini:
On small graphs critical with respect to edge colourings. 109-121 - P. J. Chase:
Subsequence numbers and logarithmic concavity. 123-140 - G. F. Estabrook, C. S. Johnson Jr., Fred R. McMorris:
An algebraic analysis of cladistic characters. 141-147 - Ralph J. Faudree, Richard H. Schelp:
Ramsey numbers for all linear forests. 149-155 - Jehuda Hartman:
The homeomorphic embedding of Kn in the m-cube. 157-160 - Michael D. Hirschhorn:
Simple proofs of identities of MacMahon and Jacobi. 161-162 - Robert R. Meyer:
Mixed integer minimization models for piecewise-linear functions of a single variable. 163-171 - András Recski:
On random partitions. 173-177 - K. Appel, W. Haken:
Special announcement. 179-180
Volume 16, Number 3, November 1976
- Ian Anderson:
Intersection theorems and a lemma of Kleitman. 181-185 - Mehdi Behzad, James E. Simpson:
Eccentric sequences and eccentric sets in graphs. 187-193 - Pavol Hell, Donald J. Miller:
Graph with given achromatic number. 195-207 - Tor Helleseth:
Some results about the cross-correlation function between two maximal linear sequences. 209-232 - Arthur M. Hobbs, John Mitchem:
The entire graph of a bridgeless connected plane graph is hamiltonian. 233-239 - Alexander K. Kelmans:
Comparison of graphs by their number of spanning trees. 241-261 - Anton Kotzig, Jean M. Turgeon:
On certain constructions for latin squares with no latin subsquares of order two. 263-270 - Charles C. Lindner:
Two finite embedding theorems for partial 3-quasigroups. 271-277 - Edward G. Thurber:
Addition chains and solutions of l(2n) = l(n) and l(2n - 1) = n + l(n) - 1. 279-289
Volume 16, Number 4, December 1976
- David W. Barnette, D. Gannon:
Manifolds with few vertices. 291-298 - John A. Brzozowski:
Run languages. 299-307 - Guy Chaty, Michel Chein:
A note on top down and bottom up analysis of strongly connected digraphs. 309-311 - Matthew M. Geller, Michael A. Harrison, Ivan M. Havel
Normal forms of deterministic grammars. 313-321 - Geoffrey R. Grimmett:
An upper bound for the number of spanning trees of a graph. 323-324 - Darald J. Hartfiel, Carlton J. Maxson:
A note on two conjectures of geller. 325-328 - George Markowsky, Robert Endre Tarjan:
Lower bounds on the lengths of node sequences in directed graphs. 329-337 - Henry Meyniel:
On the perfect graph conjecture. 339-342 - Kevin T. Phelps:
Some derived steiner triple systems. 343-352 - Ioan Tomescu
Le nombre maximal de colorations d'un graphe hamiltonien. 353-359 - William T. Trotter, John I. Moore Jr.:
Characterization problems for graphs, partially ordered sets, lattices, and families of sets. 361-381
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-12-19 22:04 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: