default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 118
Volume 118, Numbers 1-3, August 1993
- Lynn Margaret Batten:
A characterization of finite linear spaces on v points, n2<=v<(n+1)2, andb=n2+n+3 lines, n>=10. 1-9 - Abdelhamid Benhocine, A. Pawel Wojda:
Graphs with every matching contained in a cycle. 11-21 - Haitze J. Broersma
, F. Göbel:
Coloring a graph optimally with two colors. 23-31 - Peter J. Cameron, Cheryl E. Praeger:
Block-transitive t-designs I: point-imprimitive designs. 33-43 - Shalom Eliahou:
The 3x+1 problem: new lower bounds on nontrivial cycle lengths. 45-56 - Ralph J. Faudree, Debra J. Knisley:
A neighborhood condition which implies the existence of a complete multipartite subgraph. 57-68 - Alan M. Frieze, Bruce A. Reed:
Polychromatic Hamilton cycles. 69-74 - Robert B. Hughes:
Minimum-cardinality triangulations of the d-cube for d=5 and d=6. 75-118 - Stanislav Jendrol':
On face vectors and vertex vectors of convex polyhedra. 119-144 - Thomas M. Kratzke, Douglas B. West:
The total interval number of a graph, I: Fundamental classes. 145-156 - Daniel E. Loeb:
Towards the critical problem: on the coalgebraic relation between sets and multisets. 157-164 - Zhikang Lu:
The harmonious chromatic number of a complete binary and trinary tree. 165-172 - Ifor Morris, Christopher D. Wensley:
Cycle indices and subgroup lattices. 173-195 - Dayanand S. Rajan:
The equations DkY = Xn in combinatorial species. 197-206 - Samira Saidi:
Codes for perfectly correcting errors of limited size. 207-223 - Robin S. Sanders:
Graphs on which a dihedral group acts edge-transitively. 225-232 - Michel Mollard:
Interval-regularity does not lead to interval motonicity. 233-237 - Kenneth P. Bogart:
An obvious proof of Fishburn's interval order theorem. 239-242 - Priscilla S. Bremser:
Congruence classes of matrices in GL2(Fq). 243-249 - Yeow Meng Chee:
The existence of a simple 3-(28, 5, 30) design. 251-252 - Kiran B. Chilakamarri, Peter Hamburger:
On a class of kernel-perfect and kernel-perfect-critical graphs. 253-257 - Ronald J. Gould, Vojtech Rödl:
On isomorphic subgraphs. 259-262 - Qingde Kang, Yanxun Chang:
Further results about large sets of disjoint Mendelsohn triple systems. 263-268 - Jeong Han Kim:
On 3-colorings of E(Kn). 269-273 - Norbert Seifter:
On the girth of infinite graphs. 275-283 - Johannes Siemons:
Permutation groups on unordered sets II; On a theorem of Frucht. 285-288 - Jerzy Topp, Lutz Volkmann:
Some upper bounds for the product of the domination number and the chromatic number of a graph. 289-292 - Paul Monsky:
Discrete Mathematics: To: O. Heden, "On the modular n-queen problem" 102 (1992) 155-161. 293 - Discrete Mathematics: To: D.A. Holton, D. Lou and M.D. Plummer, "On the 2-extendability of planar graphs" 96 (1991) 81-99. 295-297
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-11-07 20:36 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:
