Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 12
Volume 12, Number 1, 1975
- W. N. Hsieh:
Intersection theorems for systems of finite vector spaces. 1-16 - Anton Kotzig:
On the maximal order of cyclicity of antisymmetric directed graphs. 17-25 - Arthur Pellerin, Renu C. Laskar:
Cubic graphs on twelve vertices and the line graph of a finite affine plane. 27-36 - Françoise Reynaud Garoche:
Theorie des ecoulements dans les graphes orientes sans circuit. 37-53 - J. M. S. Simões-Pereira:
On matroids on edge sets of graphs with connected subgraphs as circuits II. 55-78 - J. M. S. Simões-Pereira:
Subgraphs as circuits and bases of matroids. 79-88 - Stefan Znám:
A simple characterization of disjoint covering systems. 89-91 - Aviezri S. Fraenkel:
Further characterizations and properties of exactly covering congruences. 93-100
Volume 12, Number 2, 1975
- Morton Abramson:
Enumeration of sequences by levels and rises. 101-112 - Richard A. Brualdi, George W. Dinolt:
Truncations of principal geometries. 113-138 - John D. Dixon:
Monotonic subsequences in random sequences. 139-142 - Jean-Marie Goethals, J. J. Seidel:
The regular two-graph on 276 vertices. 143-158 - J. J. Stiffler, Ian F. Blake:
An infinite class of generalized room squares. 159-163 - William T. Trotter:
Embedding finite posets in cubes. 165-172 - W. T. Tutte:
Separation of vertices by a circuit. 173-184 - Alfred Tarski:
An interpolation theorem for irredundant bases of closure structures. 185-192 - George F. McNulty, Walter Taylor:
Combinatory interpolation theorems. 193-200 - Steven Givant:
Possible cardinalities of irredundant bases for finite closure structures. 201-204
Volume 12, Number 3, 1975
- Brian Alspach, L. T. Ollmann, K. B. Reid:
Mutually disjoint families of 0-1 sequences. 205-209 - Philippe Delsarte, Jean-Marie Goethals:
Unrestricted codes with the golay parameters are unique. 211-224 - Kenneth B. Gross:
Some new classes of strong starters. 225-243 - Darald J. Hartfiel, Carlton J. Maxson:
The chainable matrix, a special combinatorial matrix. 245-256 - Anthony J. W. Hilton:
Embedding incomplete double diagonal Latin squares. 257-268 - Alexander Rosa, Charlotte Huang:
Another class of balanced graph designs: balanced circuit designs. 269-293
Volume 12, Number 4, 1975
- Michel Deza, Paul Erdös:
Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n. 295-308 - Daniel Kennedy:
Majors of geometric strong maps. 309-340 - Donald E. Knuth:
Random matroids. 341-358 - Robert W. Robinson, Allen J. Schwenk:
The distribution of degrees in a large random tree. 359-372 - Leslie E. Trotter Jr.:
A class of facet producing graphs for vertex packing polyhedra. 373-388 - Harvey L. Abbott, Denis Hanson:
On a combinatorial problem in geometry. 389-392 - Aiden Bruen, R. Dixon:
The n-queens problem. 393-395
a service of 
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-04-25 05:29 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:
