Vol. 104, No. 1, 1983

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
A graph and its complement with specified properties. VI. Chromatic and achromatic numbers

Jin Akiyama, Frank Harary and Phillip Arthur Ostrand

Vol. 104 (1983), No. 1, 15–27
Abstract

We characterize the graphs G such that both G and its complement are n-colorable, and we specify explicitly all 171 graphs for the case n = 3. We then determine the 41 graphs for which both G and have achromatic number 3.

Mathematical Subject Classification 2000
Primary: 05C15
Secondary: 05C75
Milestones
Received: 18 February 1980
Published: 1 January 1983
Authors
Jin Akiyama
Frank Harary
Phillip Arthur Ostrand