Ars Combinatoria
Volume XLIX, August, 1998

  • A. Garcia and J. Tejel “A Lower Bound for the Number of Polygonizations of N Points in the Plane”

     

  • Suzanne Seager “Cyclic Niche Graphs and Grids”

     

  • Guantao Chen, Ralph J. Faudree and Warren E. Shreve “Note on Whitney’s Theorem for k-connected Graphs”

     

  • Mark B. Beintema, Jeffrey T. Bonn, Robert W. Fitzgerald and Joseph L. Yucas “Orderings of Finite Fields and Balanced Tournaments”

     

  • J. Gomez and M. Escudero “Edge-Colorings of Some Large Graphs on Alphabets”

     

  • Yair Caro “On graphs determined by their k-subgraphs”

     

  • S.C. Locke “Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles”

     

  • Michael S. Jacobson, Andre E. Kezdy and Jeno Lehel “Scenic Graphs I: Traceable Graphs”

     

  • X. Munoz and J. Gomez “Asymptotically Optimal (D, D’, s)-Digraphs”

     

  • Dan Archdeacon, Nora Hartsfield, C.H.C. Little and Bojan Mohar “Obstruction Sets for Outer-Projective-Planar Graphs”

     

  • F.J. Faase “On the number of specific spanning subgraphs of the graphs G x Pn”

     

  • Jennifer J. Quinn and Eric Lars Sundberg “Strong Chromatic Index in Subset Graphs”

     

  • Margaret Francel and David John “Counting Balanced Ternary Designs”

     

  • S. Ao and D. Hanson “Score Vectors and Tournaments with Cyclic Chromatic Number 1 or 2”

     

  • Lisa Markus and Douglas Rall “On Seed Graphs with Two Components”

     

  • Johannes Hattingh and Renu Laskar “On weak domination in graphs”

     

  • M.A. Francel and D.G. Sarvate “One and Two-Block Configurations in Balanced Ternary Designs”

     

  • Atsushi Kaneko and Mamoru Watanabe “String Decompositions of Graphs”

     

  • S. El-Zanati, M. Plantholt and C. Vanden Eynden “Graph Decompositions into Generalized Cubes”

     

  • Robert B. Gardner “Bicyclic Directed Triple Systems”

     

  • Roger Logan, M.K. Singh and K. Sinha “Two Series of BIB Designs”

     

  • E. Gocka, W. Kirchherr and E. Schmeichel “A Note on the Road-Coloring Conjecture”

     

  • G.H. Fricke, S.T. Hedetniemi and D.P. Jacobs “Independence and Irredundance in k-Regular Graphs”

     

  • Weidong Gao and Hongquan Yu “Note on the Union-Closed Sets Conjecture”

     

  • Dieter Olpp “A Lower Bound for the Ramsey Multiplicity of K4”

     

  • Xueliang Li “On the Determination Problem for P3-Transformation of Graphs”

     

  • Abdelhafid Berrachedi and Michel Mollard “On two problems about (0,2)-graphs and interval-regular graphs”

     

  • Ali A. Ali and Khidir Sharaf “Average Distance in Weighted Graphs with Removed Edges”

     

  • Yusheng Li and Cecil C. Rousseau “A Ramsey Goodness Result for Graphs with Many Pendant Edges”