Chromatic roots—some observations and conjectures
✍ Scribed by E.J. Farrell
- Book ID
- 107748321
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 539 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We present a new connection between colorings and hamiltonian paths: If the chromatic polynomial of a graph has a noninteger root less than or equal to then the graph has no hamiltonian path. This result is best possible in the sense that it becomes false if t 0 is replaced by any larger number.
There has been some important research conducted in India between 1990 and 1994 on the question of Business Ethics and based on the data collected from the corporate sector of Indian Industry, this polemic has been attempted. In the first part it clarifies the positions taken by the Indian academia