default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 19
Volume 19, Number 1, 1977
- David P. Brown:
Compound and unimodular matrices. 1-5 - W. H. Cunningham:
Chords and disjoint paths in matroids. 7-15 - Ronald Fagin:
The number of finite relational structures. 17-21 - I. J. Good, J. F. Crook:
The enumeration of arrays and a generalization related to contingency tables. 23-45 - Stein Krogdahl:
The dependence graph for bases in matroids. 47-59 - Laurence R. Matthews, James G. Oxley:
Infinite graphs and bicircular matroids. 61-65 - David McCarthy, Scott A. Vanstone:
Embedding (r, 1)-designs in finite projective planes. 67-76 - Michael D. Miller, Richard J. Friedlander:
On some sequencing problems in finite groups. 77-84 - Carsten Thomassen:
An ore-type condition implying a digraph to be pancyclic. 85-92 - Linda M. Lesniak-Foster:
A note on stable graphs. 93-97 - Volker Strehl:
A note on similarity relations. 99-101
Volume 19, Number 2, 1977
- Brian Alspach, Moshe Rosenfeld:
On embedding triangle-free graphs in unit spheres. 103-111 - Jean-Claude Bermond, Johanan Schönheim:
G-decomposition of Kn, where G has four vertices or less. 113-120 - Charles E. Blair, Robert G. Jeroslow:
The value function of a mixed integer program: I. 121-138 - Dwight Duffus, Ivan Rival:
Path length in the covering graph of a lattice. 139-158 - Fanica Gavril
:
Algorithms on clique separable graphs. 159-165 - Joseph P. S. Kung:
The core extraction axiom for combinatorial geometries. 167-175 - Nimrod Megiddo:
Mixtures of order matrices and generalized order matrices. 177-181 - Thomas Ströhlein, Ludwig Zagler:
Analyzing games by Boolean matrix iteration. 183-193 - J. Adrian Bondy, Carsten Thomassen:
A short proof of Meyniel's theorem. 195-197
Volume 19, Number 3, 1977
- A. Czerniakiewicz:
Minimal graphs with cyclic color group. 201-212 - Frances Chevarley Edmonds:
Rectangular arrays. 213-227 - Paul Erdös, Amram Meir:
On total matching numbers and total covering numbers of complementary graphs. 229-233 - Jonathan Goldstine:
A simplified proof of Parikh's theorem. 235-239 - Stephen H. Hechler:
On infinite graphs with a specified number of colorings. 241-255 - Frank K. Hwang, J. C. Lagarias:
Minimum range sequences of all k-subsets of a set. 257-264 - Diane Johnson:
A (2, 11) combinatorial groupoid. 265-271 - Meir Katchalski:
Intersecting all edges of convex polytopes by planes. 273-279 - Michel Riviere:
Amas dans les graphes planaires. 281-286 - Eiichi Bannai:
Examples of groups which have a graphical regular representation. 287-288 - Torleiv Kløve:
The modular n-queen problem. 289-291 - Carsten Thomassen:
Counterexamples to the edge reconstruction conjecture for infinite graphs. 293-295
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-12-09 00:14 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:
