default search action
European Journal of Combinatorics, Volume 80
Volume 80, August 2019
- Elena Deza, Mathieu Dutour Sikiric, Patrick Solé:
Preface. 1-2 - Jin Akiyama, Kiyoko Matsunaga:
Unfoldings of an envelope. 3-16 - David Avis, Hans Raj Tiwary:
Compact linear programs for 2SAT. 17-22 - Eiichi Bannai, Yan Zhu:
Tight t-designs on one shell of Johnson association schemes. 23-36 - Ioulia N. Baoulina:
On a theorem of Morlaye and Joly and its generalization. 37-42 - Michel Deza, Pavel Chebotarev:
Protometrics. 43-46 - Konstantin Avrachenkov, Pavel Chebotarev, Dmytro Rubanov:
Similarities on graphs: Kernels versus proximity measures. 47-56 - Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of halved cubes. 57-70 - Sihem Mesnager, Ferruh Özbudak, Ahmet Sinak, Gérard D. Cohen:
On q-ary plateaued functions over Fq and their explicit characterizations. 71-81 - Nikolai M. Dobrovol'skii, Nikolai N. Dobrovol'skii, Irina Yu. Rebrova, Irina N. Balaba:
Latin rectangles and quadrature formulas. 82-88 - Nikolai P. Dolbilin, Mikhail Bouniaev:
Regular t-bonded systems in R3. 89-101 - Adel Alahmadi, Michel Deza, Mathieu Dutour Sikiric, Patrick Solé:
Covering aspects of the Niemeier lattices. 102-106 - Rafael G. L. D'Oliveira, Marcelo Firer:
Channel metrization. 107-119 - Sejeong Bang, Alexander L. Gavrilyuk, Jack H. Koolen:
Distance-regular graphs without 4-claws. 120-142 - Sergey Goryainov, Dmitry Panasenko:
On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs. 143-150 - Viacheslav Grishukhin:
Uniquely scaled dual cells. 151-156 - Ying-Ying Tan, Yi-Zheng Fan, Tatsuro Ito, Xiaoye Liang:
The Terwilliger algebra of the Johnson scheme J(N, D) revisited from the viewpoint of group representations. 157-171 - Alexandr O. Ivanov, Alexey A. Tuzhilin:
Steiner type ratios of Gromov-Hausdorff space. 172-183 - Aleksandar Jurisic, Janos Vidali:
The Sylvester graph and Moore graphs. 184-193 - Vladislav V. Kabanov, N. V. Maslova, Leonid Shalaginov:
On strictly Deza graphs with parameters (n, k, k-1, a). 194-202 - Yulia Kempner, Vadim E. Levit:
Violator spaces vs closure spaces. 203-213 - Sandi Klavzar, Michel Mollard:
Daisy cubes and distance cube polynomial. 214-223 - Zhi Qiao, Jongyook Park, Jack H. Koolen:
On 2-walk-regular graphs with a large intersection number c2. 224-235 - Da-Wei Yang, Yan-Quan Feng, Jin Ho Kwak, Jaeun Lee:
Symmetric graphs of valency five and their basic normal quotients. 236-246 - Hao Hu, Monique Laurent:
On the linear extension complexity of stable set polytopes for perfect graphs. 247-260 - Vadim E. Levit, Eugen Mandrescu:
1-well-covered graphs revisited. 261-272 - Kuo-Ching Huang, Ko-Wei Lih:
A note on m-near-factor-critical graphs. 273-276 - Hiroshi Maehara:
Planar lattices and equilateral polygons. 277-286 - Dmitry Malinin:
One combinatorial construction in representation theory. 287-295 - Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad:
Maximum colored trees in edge-colored graphs. 296-310 - Oleg R. Musin:
Graphs and spherical two-distance sets. 311-325 - Mark Pankov, Adam Tyc:
Connected sums of z-knotted triangulations. 326-338 - Mustapha Kabil, Maurice Pouzet, Ivo G. Rosenberg:
Free monoids and generalized metric spaces. 339-360 - Moharram N. Iradmusa, Cheryl E. Praeger:
Derangement action digraphs and graphs. 361-372 - Guangfu Wang, Sergey V. Shpectorov:
l1-embeddability of generic quadrilateral Möbius maps. 373-389 - Gaspar Mayor, Óscar Valero:
Metric aggregation functions revisited. 390-400 - Yaokun Wu, Zeying Xu, Yinfeng Zhu:
A five-element transformation monoid on labelled trees. 401-415 - Liping Yuan, Tudor Zamfirescu, Yue Zhang:
Selfishness of convex bodies and discrete point sets. 416-431
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.