Ars Combinatoria
Volume LVIII, January, 2001


  • David C. Fisher, Suh-Ryung Kim, Chang Hoon Park and Yunsun Nam "Two families of graphs that are not CCE-orientable "

  • Lauren K. Williams "On Exact n-Step Domination"

  • David Day, Wayne Goddard, Michael A. Henning and Henda C. Swart "Multipartite Ramsey Numbers"

  • Toshinori Sakai "Long Paths and Cycles Through Specified Vertices in k-Connected Graphs"

  • G. Chen, R.J. Faudree and W.E. Shreve "Weak Clique-Covering Cycles and Paths"

  • Gary Haggard and Thomas R. Mathies "Using Thresholds to Compute Chromatic Polynomials"

  • J. Ginsburg and V. Linek "A space-filling complete graph"

  • Jenifer Corp and Jennifer McNulty "On A Characterization of Balanced Matroids"

  • J.I. Brown and R.J. Nowakowski "Bounding the Roots of Independence Polynomials"

  • Peter C.B. Lam, Wai C. Shiu, Feng Sun, Jianfang Wang and Guiying Yan "Linear Vertex Arboricity, Independence Number and Clique Cover Number"

  • P. Horak, E. Bertram and S. Mohammed "Small 2-factors of Bipartite Graphs"

  • Maria Kwasnik and Maciej Zwierzchowski "Special Kinds of Domination Parameters of Edge-Deleted Graphs"

  • Allen G. Fuller and Ronald J. Gould "Path Spectra and Forbidden Families"

  • Riste Skrekovski "A note on choosability with separation for planar graphs"

  • William Pensaert "Minimum Average Broadcast Time in a Graph of Bounded Degree"

  • Klaus Dohmen "A New Perspective on the Union-Closed Sets Conjecture"

  • Sanpei Kageyama and Tsutomu Shimata "A combinatorial structure of affine (a1, ..., at)-resolvable (r,l)-designs"

  • Jianping Li, Ruqun Shen and Feng Tian "Cycles Containing Given Subsets in 1-Tough Graphs"

  • Zhang Cheng-heng "The Lucas Matrix of Order 2k Sequence {L(2k)n)"

  • I. Pelayo, C. Balbuena and J. Gomez "On the connectivity of generalized p-cycles"

  • Heather Gavlas "A New Distance Measure between Graphs"

  • Toru Kojima and Kiyoshi Ando "Minimum length of cycles through specified vertices in graphs with wide-diameter at most d"

  • Himmet Can and Lee Hawkins "A Computer Program for Obtaining Subsystems"

  • Lutz Volkmann "Spanning multipartite tournaments of semicomplete multipartite digraphs"

  • Antoaneta Klobucar "K-dominating sets of P[2k+2]xP[n] and P[m]xP[n]"

  • Siaw-Lynn Ng and Peter R. Wild "On k-arcs Covering a Line in Finite Projective Planes"

  • Hong Wang "On Quadrilaterals and Cycle Covers in a Bipartite Graph"

  • I.M. Wanless "McLeish's construction for Latin squares without intercalates"


    Back to the Ars Combinatoria page.