default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 14
Volume 14, Number 1, 1976
- Annie Astié:
Groupes de permutations primitifs d'ordre impair et denombrement de tournois sommet-primitifs. 1-15 - James E. Baumgartner, Karel Prikry:
On a theorem of silver. 17-21 - M. Edelberg, M. R. Garey, Ronald L. Graham:
On the distance matrix of a tree. 23-39 - P. Hammond:
Nearly perfect codes in distance-regular graphs. 41-56 - Denis Hanson:
Sum-free sets and Ramsey numbers. 57-61 - Vinay G. Kane, Sanat K. Basu:
On the depth of a planar graph. 63-67 - Bruno Leclerc:
Arbres et dimension des ordres. 69-76 - John Schiller:
Perceptron order for cylindrical, polar, and spherical connectivity. 77-81 - Louis W. Shapiro:
A Catalan triangle. 83-90 - David P. Sumner:
The nucleus of a point determining graph. 91-97 - Paul M. B. Vitányi:
On a problem in the collective behavior of automata. 99-101
Volume 14, Number 2, 1976
- Einar Andresen, Kjell Kjeldsen:
On certain subgraphs of a complete transitively directed graph. 103-119 - P. C. Clapham:
Steiner triple systems with block-transitive automorphism groups. 121-131 - Dominique de Werra:
An extension of bipartite multigraphs. 133-138 - Gary Haggard, Donald McCarthy, Andrew Wohlgemuth:
Extremal edge problems for graphs with given hyperoctahedral automorphism group. 139-156 - Sergiu Hart
:
A note on the edges of the n-cube. 157-163 - Linda Lesmak:
On n-hamiltonian graphs. 165-169 - André Thayse:
Difference operators and extended truth vectors for discrete functions. 171-202
Volume 14, Number 3, 1976
- Nechemia Burshtein:
On natural exactly covering systems of congruences having moduli occuring at most M times. 205-214 - L. Carlitz, Richard Scoville, Theresa Vaughan:
Enumeration of pairs of permutations. 215-239 - Frank H. Clarke, Robert E. Jamison:
Multicolorings, measures and games on graphs. 241-245 - Takashi Hamada, Izumi Yoshimura:
Traversability and connectivity of the middle graph of a graph. 247-255 - R. H. Johnson:
Simple directed trees. 257-264 - Renu C. Laskar, Bruce Auerbach:
On decomposition of r-partite graphs into edge-disjoint hamilton circuits. 265-268 - Akio Odaka, Hiroaki Fujita, Susumu Nojima, Hiroshi Narushima:
A new normal form of Boolean functions. 269-271 - Manfred W. Padberg:
A note on the total unimodularity of matrices. 273-278 - Saul Stahl, Arthur T. White:
Genus embeddings for some complete tripartite graphs. 279-296 - W. J. Walker:
Algebraic and combinatorial results for ranking competitors in a sequence of races. 297-304
Volume 14, Number 4, 1976
- Pierre Hansen, Michel Lorea:
Degrees and independent sets of hypergraphs. 305-309 - Anthony J. W. Hilton, A. Donald Keedwell:
Further results concerning p-quasigroups and complete graph decompositions. 311-318 - Charlotte Huang:
Resolvable balanced bipartite designs. 319-335 - G. R. Kampen:
Orienting planar graphs. 337-341 - John Lake:
A problem concerning infinite graphs. 343-345 - Peter McMullen:
Constructions for projectively unique polytopes. 347-358 - L. Pósa:
Hamiltonian circuits in random graphs. 359-364 - Steven Roman:
The maximum number of q-cliques in a graph with no p-clique. 365-371 - M. R. Sridharan:
Mixed self-complementary and self-converse diagraphs. 373-376 - Carsten Thomassen:
Planar and infinite hypohamiltonian and hypotraceable graphs. 377-389 - Jim Totten:
On the degree of points and lines in a restricted linear space. 391-394 - Jim Totten:
Parallelism in a restricted linear space. 395-398 - Henk van Tilborg:
A lower bound for v in a t - (v, k, λ) design. 399-402 - Alexandr V. Kostochka, L. S. Mel'nikov:
Note to the paper of Grünbaum on acyclic colorings. 403-406
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-05-13 21:26 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:
