Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 135
Volume 135, Numbers 1-3, December 1994
- Jaromir Abrham, Anton Kotzig:
All 2-regular graphs consisting of 4-cycles are graceful. 1-14 - M. E. Adams, Wieslaw Dziobiak:
Quasivarieties of distributive lattices with a quantifier. 15-28 - S. Ajoodani-Namini, Gholamreza B. Khosrovshahi:
More on halving the complete designs. 29-37 - Horst Alzer:
Refinement of an inequality of G. Bennett. 39-46 - A. Batbedat:
Two representations of finite ordered sets. 47-59 - Elizabeth J. Billington, Charles Curtis Lindner:
The spectrum for 2-perfect bowtie systems. 61-68 - Andreas Blass:
On exponentiation of G-sets. 69-79 - Beiliang Du:
On the existence of incomplete transversal designs with block size five. 81-92 - Aviezri S. Fraenkel, H. Porta, Kenneth B. Stolarsky:
The almost PV behavior of some far from PV algebraic integers. 93-101 - John P. Georges, David W. Mauro, Marshall A. Whittlesey:
Relating path coverings to vertex labellings with a condition at distance two. 103-111 - Xiaofeng Guo, Fuji Zhang:
k-Cycle resonant graphs. 113-120 - Yubao Guo, Lutz Volkmann:
On complementary cycles in locally semicomplete digraphs. 121-127 - Jin Ho Kwak, Jaeun Lee:
Enumeration of graph embeddings. 129-151 - Hongxiang Li, Yixun Lin:
The existence of infinitely many primary trees. 153-161 - Jiping Liu, Huishan Zhou:
Dominating subgraphs in graphs with some forbidden structures. 163-168 - Nadimpalli V. R. Mahadev, Uri N. Peled:
Longest cycles in threshold graphs. 169-176 - Frantisek Matús:
Extreme convex set functions with many nonnegative differences. 177-191 - P. S. Montague:
A new construction of lattices from codes over GF(3). 193-223 - Seiya Negami
:
Diagonal flips in triangulations of surfaces. 225-232 - Victor Neumann-Lara:
The 3 and 4-dichromatic tournaments of minimum order. 233-243 - P. A. Picon:
Conditions d'integrité de certains coefficients hypergéometriques: Généralisation d'un théorème de Landau. 245-263 - Frank Rhodes:
Digital metrics generated by families of paths. 265-277 - Ian Robertson:
T-chromatic polynomials. 279-286 - Douglas G. Rogers:
On critical perfect systems of difference sets. 287-301 - Nabil Shalaby:
The existence of near-Skolem and hooked near-Skolem sequences. 303-319 - Anders Bjært Sørensen:
On the number of rational points on codimension-1 algebraic sets in Pn(Fq). 321-334 - Zsolt Tuza:
Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs. 335-347 - Shaoji Xu, Jinjie Liu, Yee-Hock Peng:
The chromaticity of s-bridge graphs and related graphs. 349-358 - Yeong-Nan Yeh, Ivan Gutman:
On the sum of all distances in composite graphs. 359-365 - Serge Lawrencenko, Seiya Negami, Arthur T. White:
Three nonisomorphic triangulations of an orientable surface with the same complete graph. 367-369 - Kiyoshi Ando:
An upper bound for orders of certain (k, k_))-connected graphs. 371-375 - Marko Razpet:
On divisibility of binomial coefficients. 377-379 - Lorenzo Traldi:
Generalized activities and K-terminal reliability. II. 381-385 - Keyi Xing, Baosheng Hu:
On Kotzig's conjecture for graphs with a regular path-connectedness. 387-393
a service of 
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-04-25 04:47 CEST 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:
