default search action
Discrete Mathematics, Volume 34
Volume 34, Number 1, 1981
- Robert C. Brigham, Ronald D. Dutton:
Graphs which, with their complements, have certain clique covering numbers. 1-7 - William H. Burge:
A correspondence between partitions related to generalizations of the Rogers-Ramanujan identities. 9-15 - Lowell A. Carmony, Soon Teck Tan:
S-Quasi-symmetry. 17-24 - Steve Gallivan, E. R. Lockeberg, Peter McMullen:
Complete subgraphs of the graphs of convex polytopes. 25-29 - Mario Gionfriddo
, Charles C. Lindner:
Construction of Steiner quadruple systems having a prescribed number of blocks in common. 31-42 - Martin Grötschel, Yoshiko Wakabayashi
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. 43-59 - Cornelis Hoede, Henk Jan Veldman:
Contraction theorems in Hamiltonian graph theory. 61-67 - Paul M. B. Vitányi:
How well can a graph be n-colored? 69-80 - Charalambos A. Charalambides
Bipartitional polynomials and their applications in combinatorics and statistics. 81-84 - B. L. Misra, M. L. Chandak:
Construction of symmetric PBIB designs and related results. 85-87 - Doron Zeilberger:
Enumeration of words by their number of mistakes. 89-91 - Mitsuo Yoshizawa:
Remarks on distance-regular graphs. 93-94 - L. Zhu:
Affinely totally variant subsets of V3(GF(3)). 95-99
Volume 34, Number 2, 1981
- Erminia D'Agostini:
On caps with weighted points in PG(t, q). 103-110 - Ronald J. Gould:
On line graphs and the hamiltonian index. 111-117 - Hans-Dietrich O. F. Gronau:
On maximal families of subsets of a finite set. 119-130 - Gena Hahn:
More star sub-ramsey numbers. 131-139 - Andreas Kriegl:
A characterization of reduced incidence algebras. 141-144 - Malaz Maamoun:
Parité des cycles contenant des sommets specifiés d'un graphe. 145-152 - Yehoshua Perl, Shmuel Zaks:
Deficient generalized Fibonacci maximum path graphs. 153-164 - Svatopluk Poljak, Ales Pultr
On the dimension of trees. 165-171 - Svatopluk Poljak, Vojtech Rödl:
On set systems determined by intersections. 173-184 - Peter J. Slater:
On k-sequential and other numbered graphs. 185-193 - Pavel Tomasta:
"Dart calculus" of induced subsets. 195-198 - Brian Alspach, Moshe Rosenfeld:
Realization of certain generalized paths in tournaments. 199-202 - Louis W. Shapiro:
A combinatorial proof of a Chevyshev polynomial identity. 203-206
Volume 34, Number 3, 1981
- Jin Akiyama, Hiroshi Era, Geoffrey Exoo:
Further results on graph equations for line graphs and n-th power graphs. 209-218 - Gerald L. Alexanderson, John E. Wetzel:
Arrangements of planes in space. 219-240 - Andries E. Brouwer, Robert Tijdeman:
On the edge-colouring problem for unions of complete uniform hypergraphs. 241-260 - Darald J. Hartfiel, Carlton J. Maxson:
The construction and decomposition of patterns induced by a positive cone of functions. 261-274 - E. Marques De Sá
Note on graphs and weakly cyclic matrices. 275-281 - Denis Naddef, William R. Pulleyblank:
Matchings in regular graphs. 283-291 - Nicolae Tandareanu:
On generalized Boolean functions i. 293-299 - Barbara Turner, Ken Warner:
The structure and geometry of 4×4 pandiagonal matrices. 301-310 - Peter Frankl, Zoltán Füredi:
A short proof for a theorem of Harper about Hamming-spheres. 311-313 - Terry A. McKee:
A quantifier for matroid duality. 315-318 - Heinrich Müller:
Oriented hypergraphs, stability numbers and chromatic numbers. 319-320 - Jean-Pierre Barthélemy:
About the shortest chain between two vertices in a quasi strongly connected digraph with a potential. 321-324 - M. Boshernitzan, Aviezri S. Fraenkel:
Nonhomogeneous spectra of numbers. 325-327
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 2025-07-19 02:17 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: