Generic automorphisms and graph coloring
β Scribed by James H. Schmerl
- Book ID
- 108113449
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 187 KB
- Volume
- 291
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Graph bundles generalize the notion of covering graphs and products of graphs. Several results about the chromatic numbers of graph bundles based on the Cartesian product, the strong product and the tensor product are presented. Β© 1995 John Wiley & Sons, Inc.
Given a property P, graph G. and k 2 0, a P k-coloring is a function 7r: V(G) + { I , ... , k) such that the subgraph induced by each color class has property P; x ( G : P ) is the least k, for which G has a P k-coloring. We investigate here the theory of P colorings. Generalizations of the wellknow