Bound for
Lee, Sang-Gu; Seol, Han-Guk; Yang, Jeong-Mo
Ars Comb. 87, 3-12 (2008).
Fractional inverse and inverse fractional domination
Johnson, P. D. jun.; Walsh, M.
Ars Comb. 87, 13-21 (2008).
Critically and minimally cochromatic graphs
Ou, Lifeng
Ars Comb. 87, 23-31 (2008).
Vertex-distinguishing total coloring of graphs
Zhang, Zhongfu; Qiu, Pengxiang; Xu, Baogen; Li, Jingwen; Chen, Xiangen; Yao, Bing
Ars Comb. 87, 33-45 (2008).
Sohn, Moo Young; Yuan, Xudong
Ars Comb. 87, 47-73 (2008).
Generating orthogonal polynomials and their derivatives using vertex matching-partitions of graphs
McSorley, John P.; Feinsilver, Philip; Schott, Rene
Ars Comb. 87, 75-95 (2008).
Super-arc-connected and super-connected total digraphs
Liu, Juan; Meng, Jixiang
Ars Comb. 87, 97-104 (2008).
Alternating unimodal sequences of Whitney numbers
Salvi, Rodolfo; Zagaglia Salvi, Norma
Ars Comb. 87, 105-117 (2008).
Anderson, Ian; Ellison, Leigh H. M.
Ars Comb. 87, 119-126 (2008).
On variations of graceful labelings
Seoud, M. A.; El Sakhawi, E. A.
Ars Comb. 87, 127-138 (2008).
Notes on factor-criticality, extendibility and independence number
Zhang, Zan-Bo; Lou, Dingjun; Zhang, Xiaoyan
Ars Comb. 87, 139-146 (2008).
Meandric polygons
Panayotopoulos, A.; Vlamos, P.
Ars Comb. 87, 147-159 (2008).
On the
Civciv, Haci; Türkmen, Ramazan
Ars Comb. 87, 161-173 (2008).
On toughness and fractional
Bian, Qiuju
Ars Comb. 87, 175-180 (2008).
On graceful generalized spiders and caterpillars
Cheng, Hui; Yao, Bing; Chen, Xiang-en; Zhang, Zhong-fu
Ars Comb. 87, 181-191 (2008).
Some maximally tough circulants
Doty, Lynne L.; Ferland, Kevin K.
Ars Comb. 87, 193-203 (2008).
On maximal fractional independent sets in graphs
Kumar, K. Reji; Arumugam, S.; Macgillivray, G.
Ars Comb. 87, 205-212 (2008).
On incidence graphs
Zhang, Zhong-fu; Yao, Bing; Li, Jing-wen; Liu, Lin-zhong; Wang, Jian-fang; Xu, Bao-gen
Ars Comb. 87, 213-223 (2008).
Realizability of connected, separable,
DiMarco, D.
Ars Comb. 87, 225-233 (2008).
Algorithms for the optimal Hamiltonian path in Halin graphs
Li, Yueping; Lou, Dingjun; Lu, Yunting
Ars Comb. 87, 235-255 (2008).
Comment on “The expectation of independent domination number over random binary trees”
Clark, L. H.; McSorley, J. P.
Ars Comb. 87, 257-261 (2008).
Strongly pan-factorial property in cages
Liu, Guizhen; Yu, Qinglin
Ars Comb. 87, 263-269 (2008).
Self-centered super graph of a graph and center number of a graph
Janakiraman, T. N.; Bhanumathi, M.; Muthammai, S.
Ars Comb. 87, 271-290 (2008).
Graceful lobsters obtained from diameter four trees using partitioning technique
Panigrahi, Pratima; Mishra, Debdas
Ars Comb. 87, 291-320 (2008).
Zheng, De-Yin
Ars Comb. 87, 321-336 (2008).
Restrained domination excellent trees
Hattingh, Johannes H.; Henning, Michael A.
Ars Comb. 87, 337-351 (2008).
A cube-packing problem
Fan, Yonghui; Zhang, Yuqin; Ye, Guoyan
Ars Comb. 87, 353-358 (2008).
How close to regular must a multipartite tournament be to secure a given path covering number?
Stella, Irene; Volkmann, Lutz; Winzen, Stefan
Ars Comb. 87, 359-375 (2008).
On square-free edge colorings of graphs
Barát, J.; Varjú, P. P.
Ars Comb. 87, 377-383 (2008).
Restricted edge-connectivity of de Bruijn digraphs
Xu, Jun-Ming; Lü, Min
Ars Comb. 87, 385-392 (2008).
A new σ3 type condition for heavy cycles in weighted graphs
Chen, Bing; Zhang, Shenggui
Ars Comb. 87, 393-402 (2008).
Graph designs for eight graphs with six vertices and eight edges (index >1)
Yuan, Landang; Kang, Qingde
Ars Comb. 87, 403-413 (2008).
