Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 268
Volume 268, Number 1-3, July 2003
- R. Julian R. Abel, Norman J. Finizio, Malcolm Greig, Scott J. Lewis:
Generalized whist tournament designs. 1-19 - Jungmin Ahn, Hyun Kwang Kim, Jung Soo Kim, Mina Kim:
Classification of perfect linear codes with crown poset structure. 21-30 - Maria Axenovich:
On multiple coverings of the infinite rectangular grid with balls of constant radius. 31-48 - R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu:
On Hamilton cycle decompositions of the tensor product of complete graphs. 49-58 - Andrei A. Bulatov, Pawel M. Idziak:
Counting Mal'tsev clones on small sets. 59-80 - Marc Chastand:
Fiber-complemented graphs II. Retractions and endomorphisms. 81-101 - Iwan M. Duursma:
Extremal weight enumerators and ultraspherical polynomials. 103-127 - Elaine M. Eschen, William Klostermeyer, R. Sritharan:
Planar domination graphs. 129-137 - Gennian Ge, Clement W. H. Lam:
Resolvable group divisible designs with block size four and group size six. 139-151 - Clemens Heuberger:
On planarity and colorability of circulant graphs. 153-169 - Darla Kremer, Wai Chee Shiu:
Finite transition matrices for permutations avoiding pairs of length four patterns. 171-183 - Rao Li, Richard H. Schelp:
Every 3-connected distance claw-free graph is Hamilton-connected. 185-197 - Xuechao Li, Cun-Quan Zhang:
Chords of longest circuits in 3-connected graphs. 199-206 - Seiya Negami
:
Composite planar coverings of graphs. 207-216 - Hidefumi Ohsugi, Takayuki Hibi:
Normalized volumes of configurations related with root systems and complete bipartite graphs. 217-242 - Erich Prisner:
The recognition problem for line bigraphs. 243-256 - John Kenneth Truss:
The automorphism group of the random graph: four conjugates good, three conjugates better. 257-271 - Bao-Yin Zhang, Jie Li:
An improvement of the two-line algorithm for proving q-hypergeometric identities. 273-286 - Chiuyuan Chen, Frank K. Hwang, J. S. Lee, S. J. Shih:
The existence of hyper-L triple-loop networks. 287-291 - Gennian Ge, Clement W. H. Lam:
Bhaskar Rao designs with block size four. 293-298 - Wayne Goddard, Michael A. Henning:
Nordhaus-Gaddum bounds for independent domination. 299-302 - Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
On a list-coloring problem. 303-308 - Victor J. W. Guo:
A simple proof of Dixon's identity. 309-310 - Frank Kwang-Ming Hwang:
On Macula's error-correcting pool designs. 311-314 - Hermann Mierendorff:
Magic twin body stars generated from chains of prismoids. 315-323 - Reza Naserasr, Riste Skrekovski:
The Petersen graph is not 3-edge-colorable--a new proof. 325-326 - Micha Sharir, Shakhar Smorodinsky:
On neighbors in geometric permutations. 327-335 - Dong-Joon Shin, Wonjin Sung:
A new Kloosterman sum identity over F2m for odd m. 337-341 - Lie Zhu, Hantao Zhang:
Completing the spectrum of r-orthogonal Latin squares. 343-349
a service of 
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-04-25 05:29 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:
