The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinary chromatic number of a graph. We say a graph G is star-extremal if its star-chromatic number is equal to its fractional-chromatic number. We prove that star-extremal graphs G have the following inter
Antisymmetry and Lexicographic Product Relations
✍ Scribed by Hartmut Höft
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 436 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Graphs without proper endomorphisms are the subject of this article. It is shown that the join of two graphs has this property if and only if both summands have it, and that the lexicographic product of a complete graph or an odd circuit as first factors has this property if and only if the second f
## Abstract Bondy conjectured that every simple bridgeless graph has a small cycle double cover (SCDC). We show that this is the case for the lexicographic products of certain graphs and along the way for the Cartesian product as well. Specifically, if __G__ does not have an isolated vertex then __