default search action
Ars Combinatoria, Volume 131
Volume 131, January 2017
- Huey Voon Chen, Angelina Y. M. Chin:
Covering finite groups by subset products. Ars Comb. 131: 3-9 (2017) - Ali Golshani, Dara Moazzami, Saeed Akhoondian Amiri:
On the complexity of recognizing tenacious graphs. Ars Comb. 131: 11-21 (2017) - Zhongxun Zhu, Hongyun Wei, Xiaojun Ma, Tengjiao Wang, Wenjing Zhu:
On Harary spectral radius with given parameters. Ars Comb. 131: 23-30 (2017) - Guofei Zhou, Yaojun Chen:
The Maximum Size of C4-Free Planar Graphs. Ars Comb. 131: 31-41 (2017) - Yuansheng Yang, Bo Lv, Baigong Zheng, Xirong Xu, Ke Zhang:
The crossing number of pancake graph P4 is six. Ars Comb. 131: 43-53 (2017) - Bin Xu, Jie Wu, Qin-Fen Shi, Sifeng Liu:
A Fan-type result on fractional ID-k-factor-critical graphs. Ars Comb. 131: 55-61 (2017) - Amir Barghi, Peter Winkler:
Firefighting on Geometric Graphs with Density Bounds. Ars Comb. 131: 63-86 (2017) - Haoli Wang, Xirong Xu, Yuansheng Yang, Bao Liu, Wenping Zheng, Guoqing Wang:
An upper bound for the crossing number of locally twisted cubes. Ars Comb. 131: 87-106 (2017) - Yingqiu Yang:
Vertices of Degree 9 in Contraction Critical 8-Connected Graphs. Ars Comb. 131: 107-122 (2017) - Bo Deng, An Chang, Haixing Zhao:
Spectral determination of a class of tricyclic graphs. Ars Comb. 131: 123-141 (2017) - Damei Lu:
Distance labelings and (total-)neighbor-distinguishing colorings of the edge-multiplicity-paths-replacements. Ars Comb. 131: 143-159 (2017) - Xiaodong Chen, Mingchu Li, Meijin Xu:
Spanning 3-ended trees in k-connected claw-free graphs. Ars Comb. 131: 161-168 (2017) - Shude Long:
Counting rooted nonseparable unicursal planar maps. Ars Comb. 131: 169-181 (2017) - Xuemei Liu, Qingfeng Sun:
New error-correcting pooling designs with singular linear space. Ars Comb. 131: 183-193 (2017) - Suleyman Yuksel, Munevver Ozcan:
On Some Regular Polyhedrons In The Taxicab 3-Space. Ars Comb. 131: 195-203 (2017) - Bichang Huang, Yirong Zheng:
Explicit Constructions of Cyclic Packing and Their Related OOCs. Ars Comb. 131: 205-225 (2017) - Yali Wu, Yongqi Sun, Zhiguo Liu:
The Ramsey Numbers R(C≤n, Km). Ars Comb. 131: 227-237 (2017) - Mohammed M. M. Jaradat, Mohammad Saleh Bataineh, M. K. Al-Qeyyam:
On the basis number of the wreath product of paths with wheels and some related problems. Ars Comb. 131: 239-253 (2017) - Mingqiang An, Liming Xiong:
Extremal polyomino chains with respect to general sum-connectivity index. Ars Comb. 131: 255-271 (2017) - Peyman Niroomand, Francesco G. Russo:
On The Tensor Degree Of Finite Groups. Ars Comb. 131: 273-283 (2017) - Rangaswami Balakrishnan, S. Francis Raj, T. Kavaskar:
b-coloring of Cartesian product of odd graphs. Ars Comb. 131: 285-298 (2017) - Selda Küçükçifçi, Salvatore Milici:
Decomposition of λKv into kites and 4-cycles. Ars Comb. 131: 299-319 (2017) - Qingqiong Cai, Yingbin Ma, Jiangli Song:
Rainbow connection numbers of ladders and Mobius ladders. Ars Comb. 131: 321-330 (2017) - M. I. Jinnah, Shayida R:
On the Bounds for Sizes of Least Common Multiples of Several pairs of graphs. Ars Comb. 131: 331-346 (2017) - A. Ilkhani, Dariush Kiani:
Existence of equitable h-edge-colorings of type s = 2, 3 of Kt. Ars Comb. 131: 347-354 (2017) - Nader Jafari Rad:
Roman domination edge critical graphs having precisely two cycles. Ars Comb. 131: 355-372 (2017) - Shangwang Tan, Qilong Wang:
The Wiener index of cacti given matching number. Ars Comb. 131: 373-395 (2017) - Mojgan Afkhami, Mohammad Farrokhi Derakhshandeh Ghouchan, Kazem Khashyarmanesh:
Planar, Outerplanar And Ring Graph Cozero-Divisor Graphs. Ars Comb. 131: 397-406 (2017) - Juan Du, Damei Lv:
L(d, 1)-labelings of the edge-multiplicity-path-replacements. Ars Comb. 131: 407-424 (2017)
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-22 19:43 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: