Acyclic and star colorings of cographs
β Scribed by Andrew Lyons
- Book ID
- 113564622
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 308 KB
- Volume
- 159
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A natural digraph analog of the graph theoretic concept of βan independent setβ is that of βan acyclic set of vertices,β namely a set not spanning a directed cycle. By this token, an analog of the notion of coloring of a graph is that of decomposition of a digraph into acyclic sets. We
## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2βcolored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __aβ²__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __aβ²__(_