N. Polat. Treillis de sparation des graphes. Can. J. Math. XXVIII-4 (1976) 725752. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Representing a Concept Lattice By a Graph - Berry, Sigayret (2002) (Correct)
.... structure is closely related to the lattice structure of the so called minimal ab separators of a graph shown by Escalante in [12] which we will mention again in Section 7, and also to the lattice structure of subsets of vertices described by Halin (see [18] Sabidussi (see [34] Polat (see [31]) Hager (see [16] and Berry and Bordat (see [5] From Main Theorem 3.6, we can deduce that a co bipartite graph may have an exponential number of minimal separators, since a concept lattice can have an exponential number of elements. It is well known that, for a given size of P, the largest ....
N. Polat. Treillis de sparation des graphes. Can. J. Math., vol. XXVIII, No 4, pp. 725752, 1976.
Representing a Concept Lattice By a Graph - Berry, Sigayret (2004) (Correct)
No context found.
N. Polat. Treillis de sparation des graphes. Can. J. Math. XXVIII-4 (1976) 725752.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC