Square-free perfect graphs
✍ Scribed by Michele Conforti; Gérard Cornuéjols; Kristina Vušković
- Book ID
- 108167359
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 627 KB
- Volume
- 90
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we show that there exists an automorphism free latin square graph of order n for all n a 7 and that the number of such graphs goes to infinity with n. These results are then applied to the construction of automorphism free Steiner triple systems.
## Abstract The circular chromatic number of a graph is a well‐studied refinement of the chromatic number. Circular‐perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This article studies claw‐free circular‐perfect graphs. First, we prove that