ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 31(3) (2011)
Department of Mathematics & Statistics Wright State University Dayton, Ohio 45435, USA
One example: G is shown to be hereditary clique-Helly if and only if,
for every k ≤ 2, every triangle whose edges are each in k or more
maxcliques is itself in k or more maxcliques; equivalently, in every
induced subgraph H of G, if each edge of a triangle is nonsimplicial
in H, then the triangle itself is nonsimplicial in H.
Keywords: simplicial clique, strongly chordal graph, trivially perfect graph, hereditary clique-Helly graph, strong p-Helly graph
2010 Mathematics Subject Classification: 05C75 (05C69).
Received 30 March 2010
Accepted 2 September 2010