ArticlesA sufficient condition for self-clique graphs
References (6)
On self-clique graphs with given clique sizes
Discrete Mathematics
(2000)- et al.
On clique-critical graphs
Journal of Combinatorial Theory B
(1974)
There are more references available in the full text version of this article.
Cited by (5)
On self-clique graphs with triangular cliques
2016, Discrete MathematicsOn self-clique shoal graphs
2016, Discrete Applied MathematicsOn self-clique graphs with given clique sizes, II
2009, Discrete MathematicsA hierarchy of self-clique graphs
2004, Discrete MathematicsCitation Excerpt :A connected graph G is clique-disk if and only if B=BK(G) has a part-switching involution that maps every vertex x of B to a neighbour of x. □ The hypotheses in the following result were proved to be sufficient for self-cliqueness by Bondy, Durán, Lin and Szwarcfiter [3]. In fact, the first part of the proof of Theorem 1 in [3] shows, in our language, that G2k is clique-disk:Bondy et al. [3]
On self-clique graphs all of whose cliques have equal size
2012, Ars Combinatoria
- 1
Partially supported by UBACyT Grant TW82 and PID Conicet Grant 644/98, Argentina.
- 2
Partially supported by the Conselho Nacional de Desenvolvimento Cientifico e Tecnológico, CNPq, and Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro, FAPERJ, Brasil.
Copyright © 2005 Elsevier Ltd. All rights reserved.