Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 3 of 3

Order by Relevance | Title | Year of publication

On hereditary properties of composition graphs

Vadim E. Levit; Eugen Mandrescu — 1998

Discussiones Mathematicae Graph Theory

The composition graph of a family of n+1 disjoint graphs $H_{i} : 0 \leq i \leq n$ is the graph H obtained by substituting the n vertices of H₀ respectively by the graphs H₁,H₂,...,Hₙ. If H has some hereditary property P, then necessarily all its factors enjoy the same property. For some sort of graphs it is sufficient that all factors $H_{i} : 0 \leq i \leq n$ have a certain common P to endow H with this P. For instance, it is known that the composition graph of a family of perfect graphs is also a perfect graph (B. Bollobas, 1978), and the...

Correspondence between two antimatroid algorithmic characterizations.

Kempner, Yulia; Levit, Vadim E. — 2003

The Electronic Journal of Combinatorics [electronic only]

Square-stable and well-covered graphs.

Levit, Vadim E.; Mândrescu, Eugen — 2005

Acta Universitatis Apulensis. Mathematics - Informatics

Page 1

Download Results (CSV)