default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 243
Volume 243, Number 1-3, January 2002
- Peter Adams, Elizabeth J. Billington, Darryn E. Bryant
, Ebadollah S. Mahmoodian:
The three-way intersection problem for latin squares. 1-19 - Paolo Boldi, Sebastiano Vigna:
Fibrations of graphs. 21-66 - Yair Caro, Raphael Yuster:
List decomposition of graphs. 67-77 - Antonio Di Nola, Revaz Grigolia:
MV-algebras in duality with labelled root systems. 79-90 - Jill R. Faudree, Ralph J. Faudree:
Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian. 91-108 - Gennian Ge:
Resolvable group divisible designs with block size four. 109-119 - Frédéric Havet:
Trees in tournaments. 121-134 - Olof Heden:
Maximal partial spreads and the modular n-queen problem III. 135-150 - Mirko Lepovic:
On formal products and angle matrices of a graph. 151-160 - Hung Q. Ngo, Ding-Zhu Du:
New constructions of non-adaptive and error-tolerance pooling designs. 161-170 - Mingquan Zhan:
Neighborhood intersections and Hamiltonicity in almost claw-free graphs. 171-185 - Marcelo Muniz Silva Alves, João Roberto Gerônimo, Reginaldo Palazzo Júnior, Sueli I. Rodrigues Costa, J. Carmelo Interlando, Martinho C. Araújo:
Relating propelinear and binary G-linear codes. 187-194 - Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda:
Path factors in claw-free graphs. 195-200 - Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
Factorizations of and by powers of complete graphs. 201-205 - Karen L. Collins:
On planar and dismantlable lattices. 207-211 - Gérard Cornuéjols, Bertrand Guenin:
On dijoins. 213-216 - Feng Ming Dong, Kee L. Teo, Khee Meng Koh:
A note on the chromaticity of some 2-connected (n, n+3)-graphs. 217-221 - Paolo Dulio, Raffaele Scapellato:
Two discrete?non-discrete results. 223-228 - Anthony B. Evans:
On orthogonal orthomorphisms of cyclic and non-abelian groups. 229-233 - Rodney W. Forcade, Jack Lamoreaux:
Diameter series of lattice covering simplices. 235-239 - Wenjie He, Xinkai Yu, Honghai Mi, Yong Xu, Yufa Shen, Lixin Wang:
The (integral) sum number of Kn?E(Kr). 241-252 - Aicke Hinrichs:
Spherical codes and Borsuk's conjecture. 253-256 - Zu Nian Li, Zhen Zhen Feng:
Counterexamples against some families of chromatically unique graphs. 257-258 - Yan Liu, Jianxiu Hao:
The enumeration of near-perfect matchings of factor-critical graphs. 259-266 - Ronald C. Read, Earl Glen Whitehead Jr.:
The Tutte polynomial for homeomorphism classes of graphs. 267-272 - Talmage James Reid, Haidong Wu:
On elements in small cocircuits in minimally k-connected graphs and matroids. 273-282 - Zi-Xia Song:
A further extension of Yap's construction for ?-critical graphs. 283-290 - Jun-Ming Xu, Ke-Li Xu:
On restricted edge-connectivity of graphs. 291-298
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-08-06 22:41 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.
