Clique graphs of packed graphs
type: Item
instance of: scholarly article
title: Clique graphs of packed graphs
zbMATH Open document ID: 0603.05043
DOI: 10.1016/0012-365X(86)90048-8
author: Iwao Sato
published in: Discrete Mathematics
publication date: 1986-01-01T00:00:00Z
review text: Let \(| G|\) be the number of vertices of a graph G and \(\omega\) (G) the number of vertices in the largest clique of G. The clique graph K(G) is the intersection graph of the cliques of G. For all G, \(| K(G)| \leq 2^{| G| -\omega (G)}\) [see \textit{B. Hedman}, Discrete Math. 54, 161-166 (1986; Zbl 0569.05029)] and G is called packed if this is an equality. This paper corrects the characterization of the clique graphs of packed graphs given by Hedman.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3972907
zbMATH Keywords: density
zbMATH Keywords: Neumann graph
zbMATH Keywords: clique graphs
zbMATH Keywords: packed graphs
MaRDI profile type: Publication
cites work: Q4187840
cites work: On clique-critical graphs
cites work: The maximum number of cliques in dense graphs
full work available at URL: 0012-365x(86)90048-8
OpenAlex ID: W1992845860
description: scientific article; zbMATH DE number 3972907