Abstract
A general forniulation of hypergraph colorings is given as an introduction. In addition, this note presents an extension of a known coloring property of unimodular hypergraphs; in particular it implies that a unimodular hypergraph with maximum degree d has ari equitable k-coloring (S1,…,S k ) with 1 + (d − 1)|S k |≧|S1|≧…≧|S k |. Moreover this also holds with the same d for some transformations of H (although the rnaximum degree may be increased). An adaptation to balanced hypergraphs is given.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berge, C. (1987). Hypergraphes. Gauthier-Villars, Paris.
Bostelmann, U. (2003). Private communication.
Conforti, M., Cornuejols, G., and Zambelli, G. (2005). Bi-colorings and equitable bi-colorings of matrices. Forthcoming.
Schrijver, A. (1993). Combinatorial Optimization. Springer Verlag, New York.
de Werra, D. (1971). Equitable colorations of graphs. Revue française d'informatique et de recherche opérationnelle, R-3:3–8.
de Werra, D. (1975). A few remarks on chromatic scheduling. In: B. Roy (ed.), Combinatorial Programming, Methods and Applications, pp. 337–342, D. Reidel Publishing Company, Dordrecht.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
de Werra, D. (2005). Hypergraph Coloring by Bichromatic Exchanges. In: Avis, D., Hertz, A., Marcotte, O. (eds) Graph Theory and Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-387-25592-3_9
Download citation
DOI: https://doi.org/10.1007/0-387-25592-3_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25591-0
Online ISBN: 978-0-387-25592-7
eBook Packages: Business and EconomicsBusiness and Management (R0)