Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 259
Volume 259, Number 1-3, December 2002
- Sergei A. Abramov
, Ha Q. Le:
A criterion for the applicability of Zeilberger's algorithm to rational functions . 1-17 - Mike D. Atkinson, Timothy Stitt:
Restricted permutations and the wreath product. 19-36 - Norman Biggs:
Equimodular curves. 37-57 - Jeffrey A. Boyle:
Thresholds for random distributions on graph sequences with applications to pebbling. 59-69 - Yves Chiricota:
Application des fonctions symétriques à la résolution d'équations différentielles autonomes combinatoires. 71-90 - Ryoh Fuji-Hara, Sanpei Kageyama, Shinya Kuriki, Ying Miao, Shigenobu Shinohara:
Balanced nested designs and balanced arrays. 91-119 - Hortensia Galeana-Sánchez:
Kernels in digraphs with covering number at most 3. 121-135 - Joseph Douglas Horton, Walter D. Wallis:
Factoring the cartesian product of a cubic graph and a triangle. 137-146 - Braulio Maia Jr.:
Connected matroids with a small circumference. 147-161 - Emanuele Munarini, Norma Zagaglia Salvi:
On the rank polynomial of the lattice of order ideals of fences and crowns. 163-177 - Ivano Pinneri:
Searching for semifield flocks. 179-188 - Pedro V. Silva:
The homomorphism problem for the free monoid. 189-200 - Ernesto Vallejo:
A characterization of additive sets. 201-210 - Hanumappa B. Walikar, Fred Buckley, M. K. Itagi:
Diameter-essential edges in a graph. 211-225 - Lianzhu Zhang, Feng Tian:
Independence and connectivity in 3-domination-critical graphs. 227-236 - Jovisa D. Zunic:
Extremal problems on convex lattice polygons in sense of lp-metrics. 237-250 - Sukumar Das Adhikari, Yong-Gao Chen:
On a question regarding visibility of lattice points--III. 251-256 - Gábor Bacsó, Odile Favaron:
Independence, irredundance, degrees and chromatic number in graphs. 257-262 - Darryn E. Bryant, Hung-Lin Fu:
C4-saturated bipartite graphs. 263-268 - Janka Chlebíková:
Partial k-trees with maximum chromatic number. 269-276 - James D. Currie:
No iterated morphism generates any Arshon sequence of odd order. 277-283 - Daniel B. Dalan:
Type I neighbors of extremal type II codes of length 40 derived from Hadamard matrices. 285-291 - Charles Delorme, Odile Favaron, Dieter Rautenbach:
On the reconstruction of the degree sequence. 293-300 - Beiliang Du, Jian Wang:
Kl, k-factorization of complete bipartite graphs. 301-306 - Herbert Fleischner, Martin Kochol:
A note about the dominating circuit conjecture. 307-309 - John P. Georges, David W. Mauro:
On generalized Petersen graphs labeled with a condition at distance two. 311-318 - Tsuyoshi Nishimura:
A closure concept in factor-critical graphs. 319-324 - Dieter Rautenbach, Lutz Volkmann:
Independent domination and matchings in graphs. 325-330 - Dieter Rautenbach, Eberhard Triesch:
Reconstruction up to isometries. 331-336 - Romeo Rizzi:
Cycle cover property and CPP=SCC property are not equivalent. 337-342 - G. Sethuraman, P. Selvaraju:
One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial. 343-350 - Man-Keung Siu, Zhongfu Zhang, Sanming Zhou:
An inequality between the diameter and the inverse dual degree of a tree. 351-358 - Carsten Thomassen:
An intersection graph of straight lines. 359-360 - Mitsunori Togasaki, Koichi Yamazaki:
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs. 361-368 - Chengfu Ye, Nianzu Li:
Graphs with chromatic polynomial sum(...). 369-381 - Walter Wenzel:
A sufficient condition for a bipartite graph to be a cube. 383-386
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 05:29 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:
