Geodesic
Simplicial and nonsimplicial complete subgraphs
Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 3, pp. 577-586

Voir la notice de l'article provenant de la source Library of Science

Define a complete subgraph Q to be simplicial in a graph G when Q is contained in exactly one maximal complete subgraph ('maxclique') of G; otherwise, Q is nonsimplicial. Several graph classes-including strong p-Helly graphs and strongly chordal graphs-are shown to have pairs of peculiarly related new characterizations: (i) for every k ≤ 2, a certain property holds for the complete subgraphs that are in k or more maxcliques of G, and (ii) in every induced subgraph H of G, that same property holds for the nonsimplicial complete subgraphs of H.
Keywords: simplicial clique, strongly chordal graph, trivially perfect graph, hereditary clique-Helly graph, strong p-Helly graph 
@article{DMGT_2011_31_3_a11,
     author = {McKee, Terry},
     title = {Simplicial and nonsimplicial complete subgraphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {577--586},
     publisher = {mathdoc},
     volume = {31},
     number = {3},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2011_31_3_a11/}
}
TY  - JOUR
AU  - McKee, Terry
TI  - Simplicial and nonsimplicial complete subgraphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2011
SP  - 577
EP  - 586
VL  - 31
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2011_31_3_a11/
LA  - en
ID  - DMGT_2011_31_3_a11
ER  - 
%0 Journal Article
%A McKee, Terry
%T Simplicial and nonsimplicial complete subgraphs
%J Discussiones Mathematicae. Graph Theory
%D 2011
%P 577-586
%V 31
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2011_31_3_a11/
%G en
%F DMGT_2011_31_3_a11
McKee, Terry. Simplicial and nonsimplicial complete subgraphs. Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 3, pp. 577-586. http://geodesic.mathdoc.fr/item/DMGT_2011_31_3_a11/