default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 110
Volume 110, Numbers 1-3, December 1992
- Arie Bialostocki, P. Dierker:
On the Erdös-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings. 1-8 - Gustav Burosch, Ivan Havel, Jean-Marie Laborde:
Distance monotone graphs and a new characterization of hypercubes. 9-16 - Olivia M. Carducci:
The strong perfect graph conjecture holds for diamonded odd cycle-free graphs. 17-34 - D. Chen, Charles C. Lindner, Douglas R. Stinson:
Further results on large sets of disjoint group-divisible designs. 35-42 - Fan R. K. Chung, Persi Diaconis, Ronald L. Graham:
Universal cycles for combinatorial structures. 43-59 - Maurice Cochand, Arlette Gaillard, Heinz Gröflin:
Lattice matrices, intersection of ring families and dicuts. 61-80 - Michele Conforti, M. R. Rao:
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations. 81-118 - J. Francke, J. J. H. Meijers:
Super-visible codes. 119-134 - Takanori Hayasaka, Sadao Saito, Douglas G. Rogers:
Further results on irregular, critical perfect systems of difference sets II: systems without splits. 135-154 - Shinji Kuriki:
System of equations related to the existence conditions for arrays. 155-164 - Hong-Jian Lai, Hongyuan Lai:
Duality in graph families. 165-177 - Hong-Jian Lai, Cun-Quan Zhang:
Nowhere-zero 3-flows of highly connected graphs. 179-183 - Nian-Zu Li:
On graphs having sigma-polynomials of the same degree. 185-196 - Xiaoyun Lu:
A characterization on n-critical economical generalized tic-tac-toe games. 197-203 - Francis Maurin:
Balanced generalized handcuffed designs. 205-213 - Klaus Metsch:
Linear spaces with few lines. 215-222 - Lewis A. Nowitz:
A non-Cayley-invariant Cayley graph of the elementary Abelian group of order 64. 223-228 - Yongjin Zhu, Hao Li:
Hamilton cycles in regular 3-connected graphs. 229-249 - Hortensia Galeana-Sánchez:
On the existence of kernels and h-kernels in directed graphs. 251-255 - Janice L. Malouf:
An integer sequence from a rational recursion. 257-261 - Sheldon Parnes, Shalosh B. Ekhad:
A WZ-style proof of Jacobi polynomials' generating function. 263-264 - Edward Spence, Vladimir D. Tonchev
:
Extremal self-dual codes from symmetric designs. 265-268 - Yoshimi Egawa, Preben D. Vestergaard:
Spanning trees in a cactus. 269-274 - David C. Fisher, Jennifer Ryan:
Bounds on the largest root of the matching polynomial. 275-278 - Maurits de Graaf, Alexander Schrijver, Paul D. Seymour:
Directed triangles in directed graphs. 279-282 - Fred C. Holroyd:
Reconstructing finite group actions and characters from subgroup information. 283-287 - Stephan Olariu:
On sources in comparability graphs, with applications. 289-292 - Jia-Yu Shao, Wan-Di Wei:
A formula for the number of Latin squares. 293-296 - Julian Harvey Wood:
Is every compact code Huffman? 297-299
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-04-04 23:30 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:
