Duality and perfection for edges in cliques

https://doi.org/10.1016/0095-8956(84)90035-2Get rights and content
Under an Elsevier user license
open archive

Abstract

Given a graph G, let K(G) denote the graph whose vertices correspond with the edges of G. Two vertices of K(G) are joined by an edge if the corresponding edges in G are contained in a clique. This paper investigates some properties of G which force duality theorems for K(G).

Cited by (0)

Research supported in part by NSF Grant SPI79-26984.

Current address: Room 2-251, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139.