Reports

 

Some Classes of Uniquely Colorable Graphs ; CU-CS-003-72 Public Deposited

Downloadable Content

Download PDF
https://scholar.colorado.edu/concern/reports/3b591931k
Abstract
  • In this paper, we shall present the concept of a uniquely n-colorable graph, and then introduce a class of graphs which we shall call 6-clique rings. We shall show that 6-clique rings are useful in generating some classes of uniquely 3-colorable graphs. Moreover, we shall demonstrate how the technique rings can be extended to allow the production of other classes of uniquely 3-colorable graphs, as well as the production of uniquely n-colorable graphs, where n>3.
Creator
Date Issued
  • 1972-04-01
Academic Affiliation
Last Modified
  • 2019-12-21
Resource Type
Rights Statement
Language

Relationships

Items