External Links

    Journal: Graphs and Combinatorics

    Volume 16, Issue 2

    129 -- 137Sarmad Abbasi. How Tight Is the Bollobás-Komlós Conjecture?
    139 -- 147Arie Bialostocki, Daniel Schaal. On a Variation of Schur Numbers
    149 -- 157Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth. The Generation of Maximal Triangle-Free Graphs
    159 -- 164Yuangqiu Huang. The Maximum Genus on a 3-Vertex-Connected Graph
    165 -- 176Hong-Jian Lai. Group Connectivity of 3-Edge-Connected Chordal Graphs
    177 -- 198MingChu Li. Longest Cycles in Almost Claw-Free Graphs
    199 -- 229James G. Oxley, Haidong Wu. Matroids and Graphs with Few Non-Essential Elements
    231 -- 244Hunter S. Snevily, James A. Foster. The 2-Pebbling Property and a Conjecture of Graham s
    245 -- 256Zhongde Yan, Yue Zhao. Edge Colorings of Embedded Graphs
    runs on