Critically cochromatic graphs
β Scribed by Izak Broere; Marieta Burger
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 261 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
and z(Gu) = n -1 for every vertex u of G. Properties of critically n cochromatic graphs are discussed and we also construct graphs that are critically n-chromatic and critically ncochromatic.
π SIMILAR VOLUMES
We discuss partitions of the edge set of a graph into subsets which are uniform in their internal relationships; i.e., the edges are independent, they are incident with a common vertex (a star), or three edges meet in a triangle. We define the cochromatic index z'(G) of G to be the minimum number of
## Abstract The cochromatic number of a graph __G__, denoted by __z__(__G__), is the minimum number of subsets into which the vertex set of __G__ can be partitioned so that each sbuset induces an empty or a complete subgraph of __G__. In this paper we introduce the problem of determining for a surf
A perfect graph is critical, if the deletion of any edge results in an imperfect graph. We give examples of such graphs and prove some basic properties. We relate critically perfect graphs to well-known classes of perfect graphs, investigate the structure of the class of critically perfect graphs, a