default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 23
Volume 23, Number 1, 1978
- Thomas Andreaf:
On a problem of R. Halin concerning infinite graphs. 1-15 - Vasanti N. Bhat-Nayak, Sheshayya A. Choudum, Ranjan N. Naik
:
Characterizations of 2-variegated graphs and of 3-variegated graphs. 17-22 - F. R. K. Chung:
On partitions of graphs into trees. 23-30 - Donald L. Goldsmith, Arthur T. White:
On graphs with equal edge-connectivity and minimum degree. 31-36 - Peter Hoffman:
Products of representations of wreath products. 37-48 - Jaroslav Nesetril, Vojtech Rödl:
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph. 49-55 - Scott A. Vanstone:
Extremal (r, λ)-designs. 57-66 - Jirí Demel:
Maximal frequencies of equivalences with small classes. 67-71
Volume 23, Number 2, 1978
- Robert B. Allan, Renu C. Laskar:
On domination and independent domination numbers of a graph. 73-76 - Claude Benzaken:
Post's closed systems and the weak chromatic number of hypergraphs. 77-84 - Claude Berge:
Regularisable graphs I. 85-89 - Claude Berge:
Regularisable graphs, II. 91-95 - Ian F. Blake, Avraham A. Melkman:
On an inverse for sections of a binomial matrix. 97-104 - Douglas Cenzer, Edward Howorka:
On vertex k-partitions of certain infinite graphs. 105-113 - Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao:
Addition chains with multiplicative cost. 115-119 - Robert G. Jeroslow:
Cutting-plane theory: Algebraic methods. 121-150 - Dieter Jungnickel:
Composition theorems for difference families and regular planes. 151-158 - Torleiv Kløve:
The weight distribution of linear codes over GF(ql) having generator matrix over GF(q>). 159-168 - G. Schrage:
Some inequalities for multidimensional (0, 1)- matrices. 169-175 - Paul D. Seymour:
A two-commodity cut theorem. 177-181 - Carl Bumiller:
On rank three graphs with a large eigenvalue. 183-187
Volume 23, Number 3, 1978
- G. Boccara:
Decompositions d'une permutation d'un ensemble fini en produit de deux cycles. 189-205 - Harold Fredricksen, James Maiorana:
Necklaces of beads in k colors and k-ary de Bruijn sequences. 207-210 - Fanica Gavril:
A recognition algorithm for the intersection graphs of paths in trees. 211-227 - Ram Prakash Gupta:
An edge-coloration theorem for bipartite graphs with applications. 229-233 - Ervin Györi, Eric C. Milner:
A theorem of the transversal theory for matroids of finite character. 235-240 - Michel Las Vergnas:
An extension of Tutte's 1-factor theorem. 241-255 - Nathan Linial:
Covering digraphs by paths. 257-272 - C. Payan:
Coverings by minimal transversals. 273-277 - Stephen J. Willson:
On convergence of configurations. 279-300 - Tor Helleseth:
A note on the cross-correlation function between two binary maximal length linear sequences. 301-307 - Richard M. Karp:
A characterization of the minimum cycle mean in a digraph. 309-311 - Beatrice Loerinc:
Chromatic uniqueness of the generalized θ-graph. 313-316 - Charles Vanden Eynden:
Countable sequenceable groups. 317-318
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-04 22:09 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:
