Deux Propriétés des Arbres Binaires Ordonnés Stricts
✍ Scribed by Poupard, Christiane
- Book ID
- 123088321
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 379 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
1. Nome.nclature et relatiom gendrales. Xous appellerons une solution id6ale si, B toute temp&atnre, pression et concentration, elle satisfait Q la condition a,/N, 2 1 (1) ou N, est la fraction mol6culaire de la composante (1) et a, son acti-vit6 qui est dkfinic par: I ~, -F ~= i l E ' , -R T l n a
This work extends to dismantlable graphs many properties of dismantlable posets dealing with products, exponentiation, existence of paths in a graph of all homomorphisms, fixed clique property, etc. We show that a poset is dismantlable in the sense of Rival if and only if its comparability graph is