Chromatic Numbers of Hypergraphs

G Kavitha

doi:10.48165/

Authors

G Kavitha Assistant Professor, Selvamm Arts and Science College, Namakkal, Namakkal, Tamil Nadu 637003, India.

DOI:

https://doi.org/10.48165/

Keywords:

Hyper graph, Bipartite Graph, Edge Cut, Node Cut, Chromatic Number and k-colourable

Abstract

Positive integers m1, m2, . . . , mk are studied in this work. If and merely if G can be articulated as the edge k disjoint union of Subgraphs (SGs) Fi, fulfilling χ(Fi) ≤ mi, any graph G possess χ(G) ≤ ∏m. By appropriate i = 1interpretations, the subsequent theorem is generalized to Hypergraphs (HGs) to infer propositions on the graph’s coverings.

References

Berge, C. (1973). Graphs and Hypergraphs, North Holland, Amsterdam.

Behzad, M., Chartrand, G and Lesniak-Foster, L. (1979). Graphs and Digraphs. Prindle, Weber and Schmidt, Boston, MA.

But, S. A. (1980). A Ramsay-theoretic result involving chromatic numbers, J. Graph Theory, 2, 241-242. 4. Chartrand, G., Polimeni, A.D. (1974). Ramsey Theory and chromatic numbers, Pacific T, Math., 55, 39-43. 5. Harary, F. (1969). Graph Theory, Addison-Wesley, Reading, MA.

Harary, F., Hsu, D and Miller, Z. (1977). The biparticty of a graph, J. Graph Theory, 1, 131-133. 7. Matula, D. W. (1972). k-components, clusters, and slicings in graphs, SIAMJ. Appl. Math., 22, 459-480.