default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 6
Volume 6, Number 1, March 1990
- Noga Alon:
Transversal numbers of uniform hypergraphs. 1-4 - Thomas Bier:
Totient-numbers of the rectangular association scheme. 5-15 - Roger B. Eggleton, Paul Erdös, D. K. Skilton:
Colouring prime distance graphs. 17-32 - Ryan Hayward, Chính T. Hoàng, Frédéric Maffray:
Optimizing weakly triangulated graphs. 33-35 - Ilia Krasikov, Yehuda Roditty:
Some applications of the nash-williams lemma to the edge-reconstruction conjecture. 37-39 - Igor Kríz, Robin Thomas:
On well-quasi-ordering finite structures with labels. 41-49 - Zsolt Tuza:
Contractions and minimalk-colorability. 51-59 - Paul Y. H. Yiu:
Strongly regular graphs and Hurwitz-Radon numbers. 61-69 - Qinglin Yu:
On barrier sets of star-factors. 71-76 - Thomas Zaslavsky
:
Biased graphs whose matroids are special binary matroids. 77-93
Volume 6, Number 2, June 1990
- Pierre Baldi:
On a generalized family of colorings. 95-110 - Graham R. Brightwell:
Events correlated with respect to every subposet of a fixed poset. 111-131 - Jerrold R. Griggs, Phil Hanlon, Andrew M. Odlyzko, Michael S. Waterman:
On the number of alignments of k sequences. 133-146 - Yahya Ould Hamidoune:
A note on the addition of residues. 147-152 - H. R. Hind:
An upper bound for the total chromatic number. 153-159 - Leif K. Jørgensen, László Pyber:
Covering a graph by topological complete subgraphs. 161-171 - Dongsu Kim:
A bijective proof of Kadell's conjecture on plane partitions. 173-178 - Haruko Okamura:
Every 4k-edge-connected graph is Weakly 3k-linked. 179-185 - Vojtech Rödl:
On ramsey families of sets. 187-195 - S. K. Teo, H. P. Yap:
Packing two graphs of ordern having total size at most 2n - 2. 197-205
Volume 6, Number 3, September 1990
- Philip L. Bowers:
The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets. 207-222 - Peter Frankl:
Asymptotic solution of a turán-type problem. 223-227 - Robert Grone, Russell Merris:
Ordering trees by algebraic connectivity. 229-237 - Yasushi Iwakata:
Minimal subschemes of the group association schemes of Mathieu groups. 239-244 - Mikio Kano:
A sufficient condition for a graph to have [a, b]-factors. 245-251 - P. Katerinis:
Minimum degree of bipartite graphs and the existence ofk-factors. 253-258 - Khee Meng Koh, Kee L. Teo:
The search for chromatically unique graphs. 259-285 - Bruce M. Landman, Raymond N. Greenwell:
Some new bounds and values for van der Waerden-like numbers. 287-291 - Hiroshi Suzuki:
2-designs overGF(2m). 293-296 - Hong Zhang:
Point-color-symmetric graphs with a prime number of vertices. 297-302
Volume 6, Number 4, December 1990
- I. A. Faradzev, Alexandre A. Ivanov, Mikhail H. Klin:
Galois correspondence between permutation groups and cellular rings (association schemes). 303-332 - Zoltán Füredi:
Graphs of diameter 3 with the minimum number of edges. 333-337 - Atsushi Kaneko:
Paths and cycles concerning independent edges. 339-363 - Hiroshi Maehara, Vojtech Rödl:
On the dimension to represent a graph by a unit distance graph. 365-367 - Yoshio Mimura:
A construction of spherical 2-design. 369-372 - Zsolt Tuza:
A conjecture on triangles of graphs. 373-380 - Mieko Yamada:
Distance-regular digraphs of girth 4 over an extension ring of Z/4Z. 381-394
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-11-21 20:32 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:
