Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Graphs of Maximum Degree \(3\) and Order at Most \(16\) Which are Critical with Respect to the Total Chromatic Number.

G.M. Hamilton1, A.J. W. Hilton2
1Department of Engineering University of Reading Whiteknights Reading, U.K.
2Department of Mathematics University of Reading Whiteknighis Reading, U.K,
  • Published: 31/10/1991

Abstract

We give a list of all graphs of maximum degree three and order at most sixteen which are critical with respect to the total chromatic number.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
G.M. Hamilton, A.J. W. Hilton. Graphs of Maximum Degree \(3\) and Order at Most \(16\) Which are Critical with Respect to the Total Chromatic Number.[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 010. 129-149. DOI: .