Contents

Ars Combinatoria

  • Research article

A Characterization of 3-Tough Cubic Graphs

Bill Jackson1, P. Katerinis2
1Department of Mathematical Studies Goldsmiths’ College London SE14 6NW, England
2Department of Informatics Athens University of Economics and Business Athens, 10434 Greece
  • Published: 31/12/1994

Abstract

We show that a cubic graph is \(\frac{3}{2}\)-tough if and only if it is equal to \(K_4\) or \(K_3 \times K_3\) or else is the inflation of a 3-connected cubic graph.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Bill Jackson, P. Katerinis. A Characterization of 3-Tough Cubic Graphs[J], Ars Combinatoria, Volume 038. 145-148. .