Volume 26, Number 1, January 2010
: Some Combinatorics Related to Central Binomial Coefficients: Grand-Dyck Paths, Coloured Noncrossing Partitions and Signed Pattern Avoiding Permutations.
: The 3-Connected Graphs with Exactly k Non-Essential Edges.
Benjamin R. Smith
: Decomposing Complete Equipartite Graphs into Closed Trails of Length k.
Carol T. Zamfirescu
: An Infinite Family of Planar Non-Hamiltonian Bihomogeneously Traceable Oriented Graphs.
Volume 26, Number 2, March 2010
, Emine Sule Yazici
: On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs.
Daniel C. Slilaty
: Integer Functions on the Cycle Space and Edges of a Graph.
Volume 26, Number 3, May 2010
, Jianji Su
: The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs.
Volume 26, Number 4, July 2010
The 20th Workshop on Topological Graph Theory in Yokohama (TGT20)
: The Link Component Number of Suspended Trees.
: 20 Years of Negami's Planar Cover Conjecture.
: 2-Reducible Two Paths and an Edge Constructing a Path in (2k + 1)-Edge-Connected Graphs.
: Non-orientable Regular Maps of a Given Type over Linear Fractional Groups.
Volume 26, Number 5, September 2010
Volume 26, Number 6, November 2010
, Guizhen Liu
: Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions.
: Binding Numbers and Connected Factors.
: Proof of the Erdos-Faudree Conjecture on Quadrilaterals.
: On the Existence of Resolvable (K3 + e)-Group Divisible Designs.