Ars Combinatoria
Volume LXXXVII, April, 2008
- Sang-Gu Lee, Han-Guk Seol and Jeong-Mo Yang, "Bound For 2-Exponents of Primitive Extremal Tournaments"
- P.D. Johnson Jr. and M. Walsh, "Fractional inverse and inverse fractional domination"
- Lifeng Ou, "Critically and Minimally Cochromatic Graphs"
- Zhongfu Zhang, Pengxiang Qiu, Baogen Xu, Jingwen Li, Xiangen Chen and Bing Yao, "Vertex-distinguishing total coloring of graphs"
- Moo Young Sohn and Yuan Xudong, "iγ(1)-perfect graphs with girth at least six"
- John P. McSorley, Philip Feinsilver and Rene Schott, "Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs"
- Juan Liu and Jixiang Meng, "Super-Arc-Connected and Super-Connected Total Digraphs"
- Rodolfo Salvi and Norma Zagaglia Salvi, "Alternating unimodal sequences of Whitney numbers"
- Ian Anderson and Leigh H.M. Ellison, "Z-Cyclic Directed Moore (2,6) Generalised Whist Tournament Designs on p elements where p = 7 (mod 12)"
- M.A. Seoud and E.A. El Sakhawi, "On Variations of Graceful Labelings"
- Zan-Bo Zhang, Dingjun Lou and Xiaoyan Zhang, "Notes on factor-critically, extendability and independence number"
- A. Panayotopoulos and P. Vlamos, "Meandric polygons"
- Haci Civciv and Ramazan Turkmen, "On the (s,t)-Fibonacci and Fibonacci Matrix Sequences"
- Qiuju Bian, "On toughness and fractional f-factors"
- Hui Cheng, Bing Yao, Xiang-en Chen and Zhong-fu Zhang, "On Graceful Generalized Spiders and Caterpillars"
- Lynne L. Doty and Kevin K. Ferland, "Some Maximally Tough Circulants"
- K. Reji Kumar, S. Arumugam and G. MacGillivray, "On Maximal Fractional Independent Sets In Graphs"
- Zhang Zhong-fu, Yao Bing, Li Jing-wen, Liu Lin-zhong, Wang Jian-fang and Xu Bao-gen, "On Incidence Graphs"
- D. DiMarco, "Realizability of Connected, Separable, p-Point, q-Line Graphs with Prescribed Minimum Degree and Line Connectivity"
- Yueping Li, Dingjun Lou and Yunting Lu, "Algorithms For The Optimal Hamiltonian Path In Halin Graphs"
- L.H. Clark and J.P. McSorley, "Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees""
- Guizhen Liu and Qinglin Yu, "Strongly pan-factorial property in cages"
- T.N. Janakiraman, M. Bhanumathi and S. Muthammai, "Self-centered super graph of a graph and center number of a graph"
- Pratima Panigrahi and Debdas Mishra, "Graceful Lobsters Obtained from Diameter Four Trees Using Partitioning Technique"
- De-Yin Zheng, "Q-Analogue Of The Pascal Matrix"
- Johannes H. Hattingh and Michael A. Henning, "Restrained Domination Excellent Trees"
- Yonghui Fan, Yuqin Zhang and Guoyan Ye, "A Cube-Packing Problem"
- Irene Stella, Lutz Volkmann and Stefan Winzen, "How close to regular must a multipartite tournament be to secure a given path covering number?"
- J. Barat and P.P. Varju, "On square-free edge colorings of graphs"
- Jun-Ming Xu and Min Lu, "Restricted Edge-Connectivity of de Bruijn Digraphs"
- Bing Chen and Shenggui Zhang, "A New σ3 Type Condition for Heavy Cycles in Weighted Graphs"
- Landang Yuan and Qingde Kang, "Graph designs for eight graphs with six vertices and eight edges (index >1)"
Back to the Ars Combinatoria page.