Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 92
Volume 92, July 2009
- Ying Xu, Jixiang Meng:
On the Folded hypercube and Bi-folded Hypercube. Ars Comb. 92 (2009) - L. Sunil Chandran, N. S. Narayanaswamy:
On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts. Ars Comb. 92 (2009) - Chengye Zhao, Yuansheng Yang, Shi Lei, Linlin Sun:
The Connected and Tree Domination Number of P(n, k) for k = 4, 6, 8. Ars Comb. 92 (2009) - Konstantinos Drakakis:
A stochastic model for the number of fixed points of a Welch Costas permutation. Ars Comb. 92 (2009) - Candido Ferreira Xavier de Mendonça Neto, Ademir Aparecido Constantino, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo:
Skewness, splitting number and vertex deletion of some toroidal meshes. Ars Comb. 92 (2009) - Bratislav Iricanin, Stevo Stevic:
On Some Rational Difference Equations. Ars Comb. 92 (2009) - Zihong Tian:
The existence for large sets of disjoint pure directed triple systems with even orders. Ars Comb. 92 (2009) - Alain C. Vandal, Marston D. E. Conder, Robert Gentleman:
Minimal Covers of Maximal Cliques for Interval Graphs. Ars Comb. 92 (2009) - Yan Wang:
A family of tetravalent Frobenius graphs. Ars Comb. 92 (2009) - Jianxiu Hao:
PI Index of Some Simple Pericondensed Hexagonal Systems. Ars Comb. 92 (2009) - Yidong Sun, Xiaoxia Wang:
Determinants involving generalized Stirling numbers. Ars Comb. 92 (2009) - Bing Yao, Hui Cheng, Ming Yao, Meimei Zhao:
A Note on Strongly Graceful Trees. Ars Comb. 92 (2009) - Gary E. Stevens:
Properties of Lucas Trees. Ars Comb. 92 (2009) - Jesse S. Beder:
Foundations of Generalized Cwatsets. Ars Comb. 92 (2009) - Lorenzo Milazzo, Zsolt Tuza:
Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems. Ars Comb. 92 (2009) - Gil Kaplan, Arieh Lev, Yehuda Roditty:
On graph labeling problems and regular decompositions of complete graphs. Ars Comb. 92 (2009) - G. Santhosh:
On Weak Magic Graphs. Ars Comb. 92 (2009) - Adel T. Diab:
Study of Some Problems of Cordial Graphs. Ars Comb. 92 (2009) - Alexander E. Patkowski:
Some Partitions Where Even Parts Appear Twice. Ars Comb. 92 (2009) - R. Lakshmi, P. Paulraja:
On Optimal Orientations Of Tensor Product Of Graphs And Circulant Graphs. Ars Comb. 92 (2009) - Gabriela Araujo-Pardo, Camino Balbuena, Mika Olsen:
On (k, g; l)-dicages. Ars Comb. 92 (2009) - Bostjan Bresar, Simon Spacapan:
Broadcast domination of products of graphs. Ars Comb. 92 (2009) - Marvin Minei, Howard Skogman:
Block Diagonalization Method for the Covering Graph. Ars Comb. 92 (2009) - Gee-Choon Lau, Y. H. Peng:
Chromatic Uniqueness Of Certain Complete t-partite Graphs. Ars Comb. 92 (2009) - Delia Garijo, Alberto Márquez, M. P. Revuelta:
Tutte Uniqueness of Locally Grid Graphs. Ars Comb. 92 (2009) - Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Gui Yang:
On the Crossing Numbers of the k-th Power of Pn. Ars Comb. 92 (2009) - Tao Feng, Weisheng Qiu:
Note On (m, 2, m-1, m-2/2) Relative Difference Sets. Ars Comb. 92 (2009) - Xirong Xu, Jirimutu, Lei Wang, Zhao Min:
On the Gracefulness of the Digraphs n-Cm. Ars Comb. 92 (2009) - David R. Berman, Malcolm Greig, Douglas D. Smith:
Brother Avoiding Round Robin Doubles Tournaments II. Ars Comb. 92 (2009) - Jianchu Zeng, Yanpei Liu:
A Genus Inequality Of The Union Graphs. Ars Comb. 92 (2009) - Ying Xu, Jixiang Meng:
Some Algebraic Properties of Bi-Circulant Digraphs. Ars Comb. 92 (2009) - Morteza Esmaeili, Vida Ravanmehr:
Two Classes of Optimal Stopping Redundancy Codes. Ars Comb. 92 (2009)
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:46 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:
