𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Coloring graph bundles
✍ Sandi KlavΕΎar; Bojan Mohar πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 502 KB

## 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.

On generalized graph colorings
✍ Jason I. Brown; Derek G. Corneil πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 610 KB

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

Οƒ-polynomials and graph coloring
✍ Robert R Korfhage πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 781 KB
Dimension, Graph and Hypergraph Coloring
✍ Stefan Felsner; William T. Trotter πŸ“‚ Article πŸ“… 2000 πŸ› Springer Netherlands 🌐 English βš– 91 KB