Publication Date:
1979-01-01
Description:
We investigate the conditions under which both a graphGand its complementG¯possess a specified property. In particular, we characterize all graphsGfor whichGandG¯both (a) have connectivity one, (b) have line-connectivity one, (c) are2-connected, (d) are forests, (e) are bipartite, (f) are outerplanar and (g) are eulerian. The proofs are elementary but amusing.
Print ISSN:
0161-1712
Electronic ISSN:
1687-0425
Topics:
Mathematics