default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 25
Volume 25, Number 1, 1979
- Roland Assous, Maurice Pouzet:
Une caracterisation des mots periodiques. 1-5 - Charles E. Blair, Robert G. Jeroslow:
The value function of a mixed integer program: II. 7-19 - Béla Bollobás, Andrew Thomason:
Set colourings of graphs. 21-26 - Robert B. Feinberg:
The circular dimension of a graph. 27-31 - Michel Gondran:
Les elements p-reguliers dans les dioïdes. 33-39 - Henry Martyn Mulder
, Alexander Schrijver:
Median graphs and Helly hypergraphs. 41-50 - Anton Nijholt:
A left part theorem for grammatical trees. 51-63 - Peter J. Slater:
Path coverings of the vertices of a tree. 65-74 - Thomas O. Strommer:
The number of lines determined by a polygon. 75-84 - Harvey L. Abbott, Meir Katchalski:
A Turán type problem for interval graphs. 85-88 - James G. Oxley:
On cographic regular matroids. 89-90 - Oliver Pretzel:
Another proof of dilworth's decomposition theorem. 91-92 - Nick Wormald, Edward M. Wright:
The exponential generating function of labelled blocks. 93-96
Volume 25, Number 2, February 1979
- Brian Alspach, Torrence D. Parsons:
Isomorphism of circulant graphs and digraphs. 97-108 - Cristian Calude, Virgil Emil Cazanescu:
On topologies generated by Moisil resemblance relations. 109-115 - Paul H. Edelman:
On a fixed point theorem for partially ordered sets. 117-119 - Edward J. Farrell:
On a class of polynomials obtained from the circuits in a graph and its application to characteristics polynomials of graphs. 121-133 - Josef Hofbauer:
A short proof of the Lagrange-Good formula. 135-139 - Khee Meng Koh, T. Tan, Douglas G. Rogers:
Two theorems on graceful trees. 141-148 - Takao Nishizeki:
On the relationship between the genus and the cardinality of the maximum matchings of a graph. 149-156 - George B. Purdy:
Triangles in arrangements of lines. 157-163 - S. Ramachandran:
A test for legitimate decks. 165-173 - J. Shearer:
A property of the colored complete graph. 175-178 - Ioan Tomescu:
Le nombre minimal de colorations d'un hypergraphe k-chromatique. 179-188 - Arthur M. Farley, Stephen T. Hedetniemi, Sandra Mitchell Mitchell, Andrzej Proskurowski:
Minimum broadcast graphs. 189-193 - Anca Pascu, Gheorghe Paun:
On the planarity of bicolored digraph grammar systems. 195-197
Volume 25, Number 3, 1979
- Lars Døvling Andersen:
Lower bounds on the cover-index of a graph. 199-210 - Oleg V. Borodin:
On acyclic colorings of planar graphs. 211-236 - David McCarthy, Scott A. Vanstone:
On the structure of regular pairwise balanced designs. 237-244 - R. M. Grassl, A. P. Hillman:
Functions on tableau frames. 245-255 - Alain Guénoche:
Enumeration des tableaux standards. 257-267 - Peter J. Lorimer:
Maximal sets of permutations constructed from projective planes. 269-273 - I. Rabinovitch, I. Rival:
The rank of a distributive lattice. 275-279 - H. L. Abbott, Andrew Chiang-Fung Liu:
Bounds for the covering number of a graph. 281-284 - Vasek Chvátal:
The tail of the hypergeometric distribution. 285-287 - W. J. R. Eplett:
A note about the Catalan triangle. 289-291
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-08 09:52 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:
