Premium
Clique‐inverse graphs of K 3 ‐free and K 4 ‐free graphs
Author(s) -
Protti Fábio,
Szwarcfiter Jayme L.
Publication year - 2000
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/1097-0118(200012)35:4<257::aid-jgt3>3.0.co;2-4
Subject(s) - combinatorics , mathematics , split graph , clique sum , chordal graph , cograph , block graph , indifference graph , discrete mathematics , clique problem , clique graph , pathwidth , treewidth , clique , graph , 1 planar graph , line graph , graph power
The clique graph K ( G ) of a given graph G is the intersection graph of the collection of maximal cliques of G . Given a family ℱ of graphs, the clique‐inverse graphs of ℱ are the graphs whose clique graphs belong to ℱ. In this work, we describe characterizations for clique‐inverse graphs of K 3 ‐free and K 4 ‐free graphs. The characterizations are formulated in terms of forbidden induced subgraphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 257–272, 2000