


default search action
Discrete Mathematics, Volume 142
Volume 142, Numbers 1-3, July 1995
- Ahmed Ainouche:
A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs. 1-19 - Dan Archdeacon, David A. Grable:
The genus of a random graph. 21-37 - Robin J. Chapman:
Shrinking integer lattices. 39-48 - Biao Gao, Ding-Zhu Du, Ronald L. Graham:
A tight lower bound for the Steiner ratio in Minkowski planes. 49-63 - Frieda Granot, Michal Penn:
On the integral 4-packing of T-cuts. 65-75 - Marisa Gutierrez, Lía Oubiña:
Minimum proper interval graphs. 77-85 - Pentti Haukkanen
:
An abstract Möbius inversion formula with number-theoretic applications. 87-96 - Olof Heden:
Maximal partial spreads and the modular n-queen problem II. 97-106 - Michael A. Henning:
Irredundance perfect graphs. 107-120 - Chính T. Hoàng:
Hamiltonian degree conditions for tough graphs. 121-139 - Meir Katchalski, William McCuaig, Suzanne M. Seager:
Ordered colourings. 141-154 - George T. Kennedy, Vera Pless:
A coding theoretic approach to extending designs. 155-168 - János Körner:
Intersection number and capacities of graphs. 169-184 - Xiaoyun Lu:
A Hamiltonian game on Kn, n. 185-191 - Xiang Qing:
Reversible (m, n, k, lambda1, lambda2)-abelian divisible difference sets with k - lambda1 nonsquare. 193-201 - Lawren Smithline:
Bandwidth of the complete k-ary tree. 203-212 - Renzo Sprugnoli:
Riordan arrays and the Abel-Gould identity. 213-233 - Saul Stahl:
Bounds for the average genus of the vertex-amalgamation of graphs. 235-245 - Armen H. Zemanian:
Connectedness in transfinite graphs and the existence and uniqueness of node voltages. 247-269 - Frank W. Barnes:
Best packing of rods into boxes. 271-275 - Guo-Gang Gao, Gena Hahn:
Minimal graphs that fold onto Kn. 277-280 - Michael Krivelevich:
On a conjecture of Tuza about packing and covering of triangles. 281-286 - Costas D. Maranas
, Christodoulos A. Floudas, Panos M. Pardalos:
New results in the packing of equal circles in a square. 287-293 - Hirobumi Mizuno, Iwao Sato:
Characteristic polynomials of some graph coverings. 295-298

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.