A decomposition property of basic acyclic graphs
β Scribed by Maria Eftimie; Radu Eftimie
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 967 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract If __G__ is any graph, a __Gβdecomposition__ of a __host__ graph __H__β=β(__V__, __E__) is a partition of the edge set of __H__ into subgraphs of __H__ which are isomorphic to __G__. The __chromatic index__ of a __G__βdecomposition is the minimum number of colors required to color the p
The acyclic orientations of a graph are related to its chromatic polynomial, to its reliability, and to certain hyperplane arrangements. In this paper, an algorithm for listing the acyclic orientations of a graph is presented. The algorithm is shown to Ε½ . require O n time per acyclic orientation ge
decomposition of acyclic simplicial complexes, Discrete Mathematics 120 (