default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 265
Volume 265, Number 1-3, April 2003
- Tomoko Adachi, Masakazu Jimbo, Sanpei Kageyama:
Combinatorial structure of group divisible designs without alpha-resolution classes in each group. 1-11 - Nawarat Ananchuen, Akira Saito:
Factor criticality and complete closure of graphs. 13-21 - Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito:
Cycles having the same modularity and removable edges in 2-connected graphs. 23-30 - Bojana Borovicanin
, Stefan Grünewald, Ivan Gutman, Miroslav Petrovic:
Harmonic graphs with small number of cycles. 31-44 - Michelle R. DeDeo:
Non-Ramanujancy of Euclidean graphs of order 2r. 45-57 - T. Aaron Gulliver, Patric R. J. Östergård, Nikolai Senkevitch:
Optimal linear rate 1/2 codes over F5 and F2. 59-70 - Qiongxiang Huang:
A classification of circulant DCI(CI)-digraphs of 2-power order. 71-84 - Youngho Jang, Jeanam Park:
On a MacWilliams type identity and a perfectness for a binary linear (n, n-1, j)-poset code. 85-104 - Weimin Li:
Graphs with regular monoids. 105-118 - Zhi-Guo Liu:
Some operator identities and q-series transformation formulas. 119-139 - Jean Oesmer Loyola:
Sequences with group products from finite regular semigroups. 141-158 - Malwina J. Luczak, Colin J. H. McDiarmid:
Concentration for locally acting permutations. 159-171 - James G. Oxley:
The structure of a 3-connected matroid with a 3-separating set of essential elements. 173-187 - Maurice Pouzet, Mohamed Sobrani:
The order type of the collection of finite series-parallel posets. 189-211 - Ronald C. Read:
Chain polynomials of graphs. 213-235 - Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi:
On the number of Hamiltonian cycles in Dirac graphs. 237-250 - Csaba D. Tóth:
Illumination of polygons by 45°-floodlights. 251-260 - Zhaoyang Wu:
On the number of spikes over finite fields. 261-296 - Hong-Gwa Yeh, Gerard J. Chang:
Centers and medians of distance-hereditary graphs. 279-310 - Joseph Zaks:
The Beckman-Quarles theorem for rational spaces. 311-320 - Joseph Zaks:
Erratum to "The Beckman-Quarles theorem for rational spaces": [Discrete Mathematics 365 (2003) 311-320]. 321- - Xiqiang Zhao, Tianming Wang:
Some identities related to reciprocal functions. 323-335 - Xuding Zhu:
Circular chromatic numbers of a class of distance graphs. 337-350 - Vladimir E. Alekseev, Vadim V. Lozin:
Independent sets of maximum weight in (p, q)-colorable graphs. 351-356 - Béla Bollobás, Amites Sarkar:
Paths of length four. 357-363 - Jaroslaw Grytczuk, Wieslaw Sliwa:
Non-repetitive colorings of infinite sets. 365-373 - R. H. Jeurissen:
On the determinants of divisor matrices. 375-383 - Jianxiang Li, Yinghong Ma:
Complete-factors and (g, f)-factors. 385-391 - Rao Li:
Hamiltonicity of 3-connected quasi-claw-free graphs. 393-399 - Xuezheng Lv, Jingzhong Mao:
Total domination and least domination in a tree. 401-404 - Tomoki Nakamigawa:
A partition problem on colored sets. 405-410 - Jan Nemecek, Martin Klazar:
A bijection between nonnegative words and sparse abba-free partitions. 411-416 - Amitabha Tripathi, Sujith Vijay:
A note on a theorem of Erdös & Gallai. 417-420
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 2026-07-10 00:51 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
