default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 15
Volume 15, Number 1, 1976
- Biswa Tosh Datta:
On tangential 2-blocks. 1-22 - Michel Dehon:
Non-existence d'un 3-design de parameters λ = 2, k = 5 et ν = 11. 23-25 - Michel Las Vergnas:
Sur les arborescences dans un graphe oriente. 27-39 - J. C. Meyer:
Nombre chromatique total du joint d'un ensemble stable par un cycle. 41-54 - Gadi Moran:
The bireflections of a permutation. 55-62 - Gadi Moran:
The product of two reflection classes of the symmetric group. 63-77 - William T. Trotter, John I. Moore Jr.:
Some theorems on graphs and posets. 79-84 - Dennis E. White:
Construction of vector lists and isomorph rejection. 85-105 - Lee K. Jones:
Sur une loi de probabilite conditionelle de kleitman. 107-108
Volume 15, Number 2, 1976
- J. Adrian Bondy, Vasek Chvátal:
A method in graph theory. 111-135 - B. R. Handa, Sri Gopal Mohanty:
Higher dimensional lattice paths with diagonal steps. 137-140 - Darald J. Hartfiel, Carlton J. Maxson:
Algebraic models for two-edge-connected graphs. 141-150 - Adalbert Kerber, Jürgen Tappe:
On permutation characters of wreath products. 151-161 - K. B. Reid:
Cycles in the complement of a tree. 163-174 - D. H. Smith:
An improved version of Lloyd's theorem. 175-184 - Dominique Sotteau:
Decomposition of k*n into circuits of odd length. 185-191 - Andrew Chi-Chih Yao:
On a problem of Katona on minimal separating systems. 193-199 - Melvyn B. Nathanson:
Partial products in finite groups. 201-203
Volume 15, Number 3, 1976
- Ronald D. Baker:
Partitioning the planes of AG2m(2) into 2-designs. 205-211 - Ernest J. Cockayne, Stephen T. Hedetniemi:
Disjoint independent dominating sets in graphs. 213-222 - Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg:
On the number of subwords of everywhere growing DTOL languages. 223-234 - H. O. Foulkes:
Enumeration of permutations with prescribed up-down and inversion sequences. 235-252 - Michael Koren:
Graphs with degrees from prescribed intervals. 253-261 - Earl S. Kramer, Dale M. Mesner:
t-designs on hypergraphs. 263-296 - Nathan Linial:
A lower bound for the circumference of a graph. 297-300 - Hayo Oellrich, Karsten Steffens:
On Dilworth's decomposition theorem. 301-304 - Peter Schmitt:
Spreading information by conferences. 305-306
Volume 15, Number 4, 1976
- Cristian Calude
:
On metrizability of the free monoids. 307-310 - H. O. Foulkes:
Tangent and secant numbers and representations of symmetric groups. 311-324 - William B. Giles:
Reconstructing trees from two point deleted subtrees. 325-332 - S. Brent Morris, Robert E. Hartwig:
The generalized faro shuffle. 333-346 - A. N. Patrinos, S. Louis Hakimi:
Relations between graphs and integer-pair sequences. 347-358 - Uriel G. Rothblum:
On the number of complementary trees in a graph. 359-371 - Daniel J. Kleitman:
More on complementary trees. 373-378 - David A. Sheppard:
The factorial representation of balanced labelled graphs. 379-388 - William T. Trotter, Kenneth P. Bogart:
Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension. 389-400
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 2026-05-27 02:11 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:
