Abstract
Practical tasks of map coloring in case of objects groups’ allocation, not connected by any binary relation, come to the problem of coloring of graph [1]. This task is closely connected to the calculation of internal stable sets of graphs, calculation of chromatic number and a chromatic class of the graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kaufmann A. (1977) Introduction a la theorie des sous-ensemles flous. Masson, Paris
Berge C. (1989) Hypergraphs: combinatorics of finite sets. Elsevier Science Publishers
Monderson J.N., Nair P.S. (2000) Fuzzy graphs and fuzzy hypergraphs. Heidelberg; New-York: Physica-Verl
Bershtein L.S., Bozhenuk A.V. (2001) Maghout method for determination of fuzzy independent, dominating vertex sets and fuzzy graph kernels. J. General Systems 30: 45–52
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bershtein, L., Bozhenyuk, A., Rozenberg, I. (2005). Fuzzy Coloring of Fuzzy Hypergraph. In: Reusch, B. (eds) Computational Intelligence, Theory and Applications. Advances in Soft Computing, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31182-3_65
Download citation
DOI: https://doi.org/10.1007/3-540-31182-3_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22807-3
Online ISBN: 978-3-540-31182-9
eBook Packages: EngineeringEngineering (R0)