default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 137
Volume 137, Numbers 1-3, January 1995
- Dragic Bankovic:
All solutions of finite equations. 1-6 - Robert A. Beezer, Edward J. Farrell:
The matching polynomial of a regular graph. 7-18 - Arie Bialostocki, Paul Erdös, Hanno Lefmann:
Monochromatic and zero-sum sets of nondecreasing diameter. 19-34 - John L. Blanchard:
A construction for orthorgonal arrays with strength t>=3. 35-44 - Oleg V. Borodin:
Triangles with restricted degree sum of their boundary vertices in plane graphs. 45-51 - Mireille Bousquet-Mélou, Jean-Marc Fedou:
The generating function of convex polyominoes: The resolution of a q-differential system. 53-75 - Gustav Burosch, Pier Vittorio Ceccherini:
Isometric embeddings into cube-hypergraphs. 77-85 - Maria Rita Casali
:
Coloured knots and coloured graphs representing 3-fold simple coverings of %plane1D;54A;3. 87-98 - Alberto Cavicchioli, Mauro Meschiari:
A homology theory for colored graphs. 99-136 - Zhibo Chen:
On polynomial functions from Zn to Zm. 137-145 - Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
On illuminating line segments in the plane. 147-153 - Alain Denise, Rodica Simion:
Two combinatorial statistics on Dyck paths. 155-176 - Dwight Duffus, Hanno Lefmann, Vojtech Rödl:
Shift graphs and lower bounds on Ramsey numbers rk(l; r). 177-187 - Hikoe Enomoto, Mikio Kano:
Disjoint odd integer subsets having a constant even sum. 189-193 - Alain Goupil:
Reflection decompositions in the classical Weyl groups. 195-209 - Donovan R. Hare:
Cycles in the block-intersection graph of pairwise balanced designs. 211-221 - Mark E. Hartmann, Michael H. Schneider:
Max-balanced flows in oriented matroids. 223-240 - Glenn Hurlbert:
Multicover Ucycles. 241-249 - Stanislav Jendrol', Peter J. Owens:
Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters. 251-263 - Dal-Young Jeong:
Realizations with a cut-through Eulerian circuit. 265-275 - Mingchu Li:
Longest cycles in regular 2-connected claw-free graphs. 277-295 - Robert A. Procter, David C. Wilson:
Interpretation of a basic hypergeometric identity with Lie characters and Young tableaux. 297-302 - Ivan Rival, Nejib Zaguia:
Perpendicular orders. 303-313 - Steven J. Rosenberg:
A large index theorem for orthogonal arrays, with bounds. 315-318 - Paul M. Terwilliger:
A new inequality for distance-regular graphs. 319-332 - Yue Zhao:
On the edge-reconstruction of 3-connected planar graphs with minimum valency 4. 333-344 - Robert E. L. Aldred, Richard P. Anstee:
On the density of sets of divisors. 345-349 - David W. Barnette:
A short proof of the d-connectedness of d-polytypes. 351-352 - Peter Brass:
Packing constants in graphs and connectivity. 353-355 - Knut Dale, Ivar Skau:
The (Generalized) Secretary's Packet Problem and the Bell numbers. 357-360 - Wayne Goddard:
Mistilings with dominoes. 361-365 - António Guedes de Oliveira:
On the Steinitz exchange lemma. 367-370 - Li Fuzhong, Weidong Gao:
Addition theorems on Zn. 371-376 - Kevin McDougal:
On asymmetric (0, 1)-matrices with given row and column sum vectors. 377-381 - Weisheng Qiu:
A necessary condition on the existence of abelian difference sets. 383-386 - Bhalchandra D. Thatte:
On a reconstruction problem. 387-388 - Jan van den Heuvel:
Long cycles in graphs containing a 2-factor with many odd components. 389-393 - Sanming Zhou:
Matroid tree graphs and interpolation theorems. 395-397
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-25 22:46 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:
