default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 133
Volume 133, Numbers 1-3, October 1994
- Shreeram S. Abhyankar, Ikkwon Yie:
Small degree coverings of the affine line in characteristic two. 1-23 - Shreeram S. Abhyankar, Jun Ou, Avinash Sathaye:
Alternating group coverings of the affine line for characteristic two. 25-46 - Ahmed M. Assaf:
Bipacking pairs by quintuples: The case nu=13 (mod 20). 47-54 - Frank W. Barnes:
How many 1×2×4 bricks can you get into an odd box? 55-78 - Luigi Cerlienco, Marina Mureddu:
Generalized Robinson-Schensted correspondences: a new algorithm. 79-88 - Mark N. Ellingham, Robert L. Hemminger, Kathryn E. Johnson:
Contractible edges in longest cycles in non-Hamiltonian graphs. 89-98 - Winfried Geyer:
On Tamari lattices. 99-122 - Robert B. Hughes:
Lower bounds on cube simplexity. 123-138 - Alexander V. Ivashchenko:
Some properties of contractible transformations on graphs. 139-145 - Zygmunt Jackowski:
Characterizations of two classes of digraphs. 147-157 - Ming Jiang, Frank Ruskey
:
Determining the hamilton-connectedness of certain vertex-transitive graphs. 159-169 - Hiroshi Kimura:
Classification of Hadamard matrices of order 28. 171-180 - R. Klein:
On the colorability of m-composed graphs. 181-190 - Jan Kratochvíl:
Regular codes in regular graphs are difficult. 191-205 - Eric Mendelsohn, P. Rodney:
The existence of court balanced tournament designs. 207-216 - David J. Rasmussen, Carla D. Savage:
Hamilto-connected derangement graphs on S n. 217-223 - James H. Schmerl:
Tiling space with notched cubes. 225-235 - Marcin Jan Schroeder:
Dependence systems with the operator-image exchange property. 237-248 - Yongbing Shi:
The number of cycles in a hamilton graph. 249-257 - B. Uhrin:
The set of neighbours of a set in a point-lattice. 259-266 - Shaoji Xu:
Classes of chromatically equivalent graphs and polygon trees. 267-278 - Horst Alzer:
An inequality for increasing sequences and its integral analogue. 279-283 - Paul L. Check, Charles J. Colbourn:
Concerning difference families with block size four. 285-289 - D. Frank Hsu, Tomasz Luczak:
On the k-diameter of k-regular k-connected graphs. 291-296 - Sandi Klavzar, Uros Milutinovic:
Strong products of Kneser graphs. 297-300 - Anping Li:
On the conjecture at two counterfeit coins. 301-306 - Hunter S. Snevily:
The snake-in-the-box problem: A new upper bound. 307-314 - Jun-Ming Xu:
A sufficient condition for equality of arc-connectivity and minimum degree of a diagraph. 315-318 - Min Song Zeng, Ke Min Zhang:
Neighborhood unions and Hamiltonian properties. 319-324 - Ke Min Zhang, Yannis Manoussakis, Min Song Zeng:
Complementary cycles containing a fixed arc in diregular bipartite tournaments. 325-328
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-12-12 01:10 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:
