The purpose of this note is to point out a relationship between graph coloring and monotone functions defined on posets. This relationship permits us to deduce certain properties of the chromatic polynomial of a graph.
Connection-graph and iteration-graph of monotone boolean functions
β Scribed by Y. Robert; M. Tchuente
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 312 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Methods based on AND/OR graph representations of Boolean relations provide a promising new way of approaching VLSI CAD design automation problems. AND/OR graphs can represent any Boolean network and they allow for systematic reasoning through the application of the technique of recursive learning. A
lterated function systems have been applied as a means of shape representation and generation. This paper describes how they may be applied in a similar manner to graphs. Although the study is in its early stages, it is anticipated that this means of representation will offer a range of new techniqu