A Problem on Hinged Dissections with Colours J. AkiyamaF. HurtadoJ. Urrutia OriginalPaper Pages: 145 - 159
Configurations in 4-Cycle Systems Darryn BryantMike GrannellMartin Mačaj OriginalPaper Pages: 161 - 179
The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1 Weiting CaoMichael J. Pelsmajer OriginalPaper Pages: 181 - 183
On the Achromatic Index of for a Prime q Mirko HorňákŠtefan PčolaMariusz Woźniak OriginalPaper Pages: 191 - 203
Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition Jesper JanssonTakeshi Tokuyama OriginalPaper Pages: 205 - 222
A Note on Convex Decompositions of a Set of Points in the Plane Víctor Neumann-LaraEduardo Rivera-CampoJorge Urrutia OriginalPaper Pages: 223 - 231
The 3-Connected Graphs with Exactly Three Non-Essential Edges James OxleyHaidong Wu OriginalPaper Pages: 233 - 246
An Improved Bound for the Crossing Number of C m C n : a Self–Contained Proof Using Mostly Combinatorial Arguments Gelasio SalazarEdgardo Ugalde OriginalPaper Pages: 247 - 253
On Steiner Versions of (bi)Connectivity in Network Problems A. VolgenantC.W. Duin OriginalPaper Pages: 263 - 273
Disjoint Triangles of a Cubic Line Graph Xiao-Dong ZhangStanislaw Bylka OriginalPaper Pages: 275 - 280