Title of article
On Clique-inverse graphs of Kp-free graphs
Author/Authors
Gravier، نويسنده , , Sylvain and Protti، نويسنده , , Fلbio and Sales، نويسنده , , Clلudia Linhares، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
5
From page
139
To page
143
Abstract
In this paper, for p ≥ 4 , we prove that the family of forbidden induced subgraphs for a graph G such that the clique graph of G is Kp-free is finite, providing a proof of a conjecture in [F. Protti and J. Szwarcfiter. Clique-Inverse Graphs of K3-free and K4-free Graphs, Journal of Graph Theory (2000) 257–272]. We also give an upper bound for the rank of Sperner conformal hypergraphs that contain p pairwise intersecting edges and are minimal with respect to all these properties.
Keywords
clique-inverse graphs , clique-graphs , Sperner hypergraphs
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2004
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453775
Link To Document