Journal of Combinatorial Theory, Series B, Volume 75

Volume 75, Number 1, January 1999

• Alan Stacey, Peter Weidl:
  The Existence of Exactlym-Coloured Complete Subgraphs. 1-18
  Electronic Edition (link) BibTeX
• Zhaoyang Wu:
  On Extremal Connectivity Properties of Unavoidable Matroids. 19-45
  Electronic Edition (link) BibTeX
• Aleksander Malnic, Dragan Marusic:
  Constructing 4-Valent 1/2-Transitive Graphs with a Nonsolvable Automorphism Group. 46-55
  Electronic Edition (link) BibTeX
• Gelasio Salazar:
  On the Intersections of Systems of Curves. 56-60
  Electronic Edition (link) BibTeX
• Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen:
  Highly Connected Sets and the Excluded Grid Theorem. 61-73
  Electronic Edition (link) BibTeX
• Jianji Su:
  The Number of Removable Edges in 3-Connected Graphs. 74-87
  Electronic Edition (link) BibTeX
• Bing Wei:
  On the Circumferences of Regular 2-Connected Graphs. 88-99
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5. 100-109
  Electronic Edition (link) BibTeX
• Atsushi Kaneko, Hiroshi Maehara, Mamoru Watanabe:
  On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph. 110-115
  Electronic Edition (link) BibTeX
• Valery A. Liskovets:
  A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps. 116-133
  Electronic Edition (link) BibTeX
• Frédéric Maffray, Bruce A. Reed:
  A Description of Claw-Free Perfect Graphs. 134-156
  Electronic Edition (link) BibTeX
• Bing Wei:
  A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs. 157-159
  Electronic Edition (link) BibTeX
• Béla Bollobás:
  Turán's Theorem and Maximal Degrees. 160-164
  Electronic Edition (link) BibTeX

Volume 75, Number 2, March 1999

• Stephan Brandt:
  9-Connected Claw-Free Graphs Are Hamilton-Connected. 167-173
  Electronic Edition (link) BibTeX
• Tomasz Luczak:
  R(C_n, C_n, C_n)<=(4+o(1)) n. 174-187
  Electronic Edition (link) BibTeX
• Dragan Marusic, Cheryl E. Praeger:
  Tetravalent Graphs Admitting Half-Transitive Group Actions: Alternating Cycles. 188-205
  Electronic Edition (link) BibTeX
• Brian Curtin, Kazumasa Nomura:
  Some Formulas for Spin Models on Distance-Regular Graphs. 206-236
  Electronic Edition (link) BibTeX
• András Frank:
  Finding Minimum Generators of Path Systems'. 237-244
  Electronic Edition (link) BibTeX
• Xuding Zhu:
  The Game Coloring Number of Planar Graphs. 245-258
  Electronic Edition (link) BibTeX
• Gerard J. Chang, Daphne Der-Fen Liu, Xuding Zhu:
  Distance Graphs and T-Coloring. 259-269
  Electronic Edition (link) BibTeX
• Xiao Zhou, Takao Nishizeki:
  Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings. 270-287
  Electronic Edition (link) BibTeX
• Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
  On the Vertex-Distinguishing Proper Edge-Colorings of Graphs. 288-301
  Electronic Edition (link) BibTeX