default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 8
Volume 8, Number 1, March 1974
- H. L. Abbott, D. Hanson:
On finite Δ-systems. 1-12 - László Babai
:
Automorphism groups of graphs and edge-contraction. 13-20 - Béla Bollobás:
Three-graphs without two triples whose symmetric difference is contained in a third. 21-24 - Peter C. Fishburn:
On the sum-of-ranks winner when losers are removed. 25-30 - David A. Klarner, Ronald L. Rivest:
Asymptotic bounds for the number of convex n-ominoes. 31-40 - Sukhamay Kundu:
A factorization theorem for a certain class of graphs. 41-47 - Uppaluri S. R. Murty:
Extremal critically connected matroids. 49-58 - Leon J. Osterweil:
Some classes of uniquely 3-colorable graphs. 59-69 - Lía Oubiña:
Des cycles et cocycles en hypergraphes. 71-80 - Gustavus J. Simmons:
On a problem of Erdös concerning a 3-coloring of the unit sphere. 81-84 - William T. Trotter:
Dimension of the crown Skn. 85-103 - Jean Van Buggenhaut:
On the existence of 2-designs S2(2, 3, v) without repeated blocks. 105-109
Volume 8, Number 2, April 1974
- Amos Altshuler, Leon Steinberg:
Neighborly combinatorial 3-manifolds with 9 vertices. 113-137 - Robert E. Bixby:
ℓ-matrices and a characterization of binary matroids. 139-145 - L. Carlitz, Theresa Vaughan:
Enumeration of sequences of given specification according to rises, falls and maxima. 147-167 - William B. Giles:
On reconstructing maximal outerplanar graphs. 169-172 - Earl S. Kramer:
Indecomposable triple systems. 173-180 - Bennet Manvel:
Some basic observations on Kelly's conjecture for graphs. 181-185 - Ismail Burhan Türksen:
Extensions on solutions of Boolean equations via its conjunctions. 187-200 - David Lubell:
Combinatorial orthogonality in abstract configurations. 201-203
Volume 8, Number 3, May 1974
- B. Andrásfai, Paul Erdös, Vera T. Sós:
On the connection between chromatic number, maximal clique and minimal degree of a graph. 205-218 - Edward A. Bender:
Convex n-ominoes. 219-226 - Harold Brown, Larry Masinter:
An algorithm for the construction of the graphs of organic molecules. 227-244 - Stefan A. Burr, John A. Roberts:
On Ramsey numbers for linear forests. 245-250 - C. R. J. Clapham:
Hamiltonian arcs in self-complementary graphs. 251-255 - David A. Draki, Mark P. Hale Jr.:
Half counts in latin quarters. 257-268 - Pierre Duchet:
Sur les hypergraphes invariants. 269-280 - Paul Erdös, Daniel J. Kleitman:
Extremal problems among subsets of a set. 281-294 - Chong-Yun Chao:
A note on labeled symmetric graphs. 295-297
Volume 8, Number 4, 1974
- Jean-Claude Bermond:
An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits. 301-304 - Curtis R. Cook:
Two characterizations of interchange graphs of complete m-partite graphs. 305-311 - Ralph J. Faudree, Richard H. Schelp:
All Ramsey numbers for cycles in graphs. 313-329 - Jean Françon:
Preuves combinatoires des identites d'Abel. 331-343 - Dennis P. Geller:
Generalization of a theorem of Fleck, Hedetniemi and Oehmke on δ*-semigroups of automata. 345-349 - Linda M. Lesniak:
Results on the edge-connectivity of graphs. 351-354 - Thomas L. Magnanti:
Complementary bases of a matroid. 355-361 - Ján Plesník:
One method for proving the impossibility of certain Moore graphs. 363-376 - David E. Scheim:
The number of edge 3-colorings of a planar cubic graph as a permanent. 377-382 - John Sheehan:
Non-bipartite graphs of girth 4. 383-402
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-10-31 20:05 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:
