Entropy splitting for antiblocking corners and perfect graphs
✍ Scribed by I. Csiszár; J. Körner; L. Lovász; K. Marton; G. Simonyi
- Publisher
- Springer-Verlag
- Year
- 1990
- Tongue
- English
- Weight
- 716 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We introduce the class of graphs such that every induced subgraph possesses a vertex whose neighbourhood can be split into a clique and a stable set. We prove that this class satisfies Berge's strong perfect graph conjecture. This class contains several well-known classes of (perfect) graphs and is
A graph G is strongly perfect if every induced subgraph H of G contains a stable set that meets all the maximal cliques of H . We present a graph decomposition that preserves strong perfection: more precisely, a stitch decomposition of a graph G = (V, €1 is a partition of V into nonempty disjoint su
The transport of thermal energy in thermodynamic.8 is &s&bed as the product of entropy $0~ and of the absolute temperature, in analogy to the volume flow and pressure in oil hydraulics and to electric charge flow ( = current) and voltage in electron&. Bond graph-s are shown to be especially a&table