default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 213
Volume 213, Number 1-3, February 2000
- Leonid A. Bassalygo, Gérard D. Cohen, Gilles Zémor
:
Codes with forbidden distances. 3-11 - Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder:
The congestion of n-cube layout on a rectangular grid. 13-19 - Halina Bielak:
Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs. 21-24 - Volodia Blinovsky:
Asymptotical properties of linear codes. 25-28 - Béla Bollobás, Douglas B. West:
A note on generalized chromatic number and generalized girth. 29-34 - Stephen D. Cohen, Nikolai N. Kuzjurin:
On the packing radius and the covering radius of equal-weight codes. 35-42 - Nathaniel Dean, Mekkia Kouider:
Gallai's conjecture for disconnected graphs. 43-54 - Stefan M. Dodunekov, Ivan N. Landjev:
Near-MDS codes over some small fields. 55-65 - Michelle A. Donalies, Bernd S. W. Schröder:
Performance guarantees and applications for Xia's algorithm. 67-86 - Hikoe Enomoto, Shinsuke Matsunaga, Katsuhiro Ota:
Graph decompositions and D3-paths with a prescribed endvertex. 87-104 - Igor Fabrici, Peter J. Owens, Hansjoachim Walther:
Non-hamiltonian polyhedral graphs with two types of faces. 105-113 - Odile Favaron:
Extendability and factor-criticality. 115-122 - Peter C. Fishburn, Prasad Tetali, Peter Winkler:
Optimal linear arrangement of a rectangular grid. 123-139 - Grzegorz Gancarzewicz, A. Pawel Wojda:
Graphs with every k-matching in a Hamiltonian cycle. 141-151 - Gregory Z. Gutin, Alexandr V. Kostochka, Bjarne Toft:
On the Hajo's number of graphs. 153-161 - Ching J. Guu:
The McFunction. 163-167 - Hamamache Kheddouci, Jean-François Saclé, Mariusz Wozniak:
Packing two copies of a tree into its fourth power. 169-178 - Henry A. Kierstead, William T. Trotter:
Interval orders and dimension. 179-188 - Jan Kratochvíl, Peter Mihók:
Hom-properties are uniquely factorizable into irreducible factors. 189-194 - Justyna Kurkowiak, Andrzej Rucinski:
Solitary subgraphs of random graphs. 195-209 - Ivan N. Landjev:
Linear codes over finite fields and finite projective geometries. 211-244 - Uwe Leck:
A property of colored complexes and their duals. 245-251 - Alexander A. Sapozhenko:
On computing boundary functional sums. 253-260 - Günter Schaar:
On special numberings of hypergraphs. 261-268 - Juriaan Simonis:
The [23, 14, 5] Wagner code is unique. 269-282 - Faina I. Solov'eva:
Perfect binary codes: bounds and properties. 283-290 - Jean-Pierre Tillich:
Edge isoperimetric inequalities for product graphs. 291-320 - Zsolt Tuza:
Extremal bi-Helly families. 321-331 - A. Pawel Wojda:
A note on the colour class of a self-complementary graph. 333-336
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-01-14 21:05 CET 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:
