default search action
Discrete Mathematics, Volume 126
Volume 126, Numbers 1-3, March 1994
- Ahmed M. Assaf, L. P. S. Singh:
Packing pairs by quintuples with index 2: v odd, v != 13 (mod 20). 1-12 - Andries E. Brouwer:
On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group M12). 13-27 - Neil P. Carnes:
Cyclic antiautomorphisms of Mendelsohn triple systems. 29-45 - Virgil Emil Cazanescu, Gheorghe Stefanescu:
Classes of finite relations as initial abstract data types - II. 47-65 - Nathaniel Dean, Jennifer S. Zito:
Well-covered graphs and extendability. 67-80 - F. Michel Dekking:
Iteration of maps by an automaton. 81-86 - J. Keith Dugdale, Anthony J. W. Hilton:
The total chromatic number of regular graphs whose complement is bipartite. 87-98 - Arne Dür:
On the covering radius of Reed - Solomon codes. 99-105 - Paul H. Edelman, Rodica Simion:
Chains in the lattice of noncrossing partitions. 107-119 - Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel:
On the rotation distance of graphs. 121-135 - Aviezri S. Fraenkel, Clark Kimberling:
Generalized Wythoff arrays, shuffles and interspersions. 137-149 - Marietjie Frick, Michael A. Henning:
Extremal results on defective colorings of graphs. 151-158 - Alexander V. Ivashchenko:
Contractible transformations do not change the homology groups of graphs. 159-170 - Alexander V. Ivashchenko, Yeong-Nan Yeh:
Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes. 171-178 - Charles Knessl:
Asymptotic behavior of high-order differences of the plane partition function. 179-193 - Christian Krattenthaler, Sri Gopal Mohanty:
q-generalization of a ballot problem. 195-208 - Alain Lascoux, Piotr Pragacz:
Divided differences and ideals generated by symmetric polynomials. 209-215 - Eran London:
A new proof of the colored Kruskal - Katona theorem. 217-223 - Q. Mushtaq, F. Shaheen:
Factor groups of G6, 6, 6 through coset diagrams for an action on PL (Fq). 225-238 - Miroslav Petrovic, Ivan Gutman, Mirko Lepovic:
Graphs with small numbers of independent edges. 239-244 - Themistocles Politof, Appajosyula Satyanarayana:
Minors of quasi 4-connected graphs. 245-256 - Virginia Rice, Richard D. Ringeisen:
On cohesion stable graphs. 257-272 - R. Bruce Richter, Paul D. Seymour, Jozef Sirán:
Circular embeddings of planar graphs in nonspherical surfaces. 273-280 - Adrian Riskin:
Projective plane embeddings of polyhedral pinched maps. 281-291 - Bruce E. Sagan, Yeong-Nan Yeh, Günter M. Ziegler:
Maximizing Möbius functions on subsets of Boolean algebras. 293-311 - P. Sankaran, K. Varadarajan:
A note on the homotopy type of posets. 313-323 - Yongbing Shi:
On simple MCD graphs containing a subgraph homeomorphic to K4. 325-338 - Huei-Jan Shyr, S. S. Yu, Gabriel Thierrin:
Monogenic e-closed languages and dipolar words. 339-348 - Iain A. Stewart:
Deciding whether a planar graph has a cubic subgraph is NP-complete. 349-357 - Hong Wang:
On K1, k-factorizations of a complete bipartite graph. 359-364 - Gilles Zémor:
A generalization to noncommutative groups of a theorem of Mann. 365-372 - T. Dridi:
Distributions binaires unimodales. 373-378 - Don Rawlings:
Limit formulas for q-exponential functions. 379-383 - Michael Stiebitz:
The forest plus stars colouring problem. 385-389 - Xiang Yang, James L. Massey:
The condition for a cyclic code to have a complementary dual. 391-393 - Martin Erickson:
A conjecture concerning Ramsey's theorem. 395-398 - Dalibor Froncek:
e-Realization of double-stars. 399-402 - Jason Fulman:
A generalization of Vizing's theorem on domination. 403-406 - Zoltán Füredi:
Random Ramsey graphs for the four-cycle. 407-410 - T. N. Janakiraman:
On special classes of self-centred graphs. 411-414 - Afrodita Iorgulescu:
L-prealgebras. 415-419 - Roger Labahn, Ingo Warnke:
Quick gossiping by telegraphs. 421-424 - Gregory L. Mayhew:
Weight class distributions of de Bruijn sequences. 425-429 - Stefano D. Sarti:
Remarks on umbral evaluations of chromatic polynomials. 431-437 - Kishore Sinha:
A class of q-ary codes. 439-440 - Jerzy Zurawiecki:
Universal circuit matrix for adjacency graphs of feedback functions. 441-445
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.