Chromatic Numbers of Hypergraphs
9.38$
Year : 2022,
Volume & Issue : BPAS-Maths & Stat 41E(1), JAN-JUN 2022
Page No. : 100-103, Article Type : Original Aticle
Article DOI : 10.5958/2320-3226.2022.00014.5 (Received on 18.01.2022/ Revised on 28.04.2022/ Accepted on 30.05.2022 Online First Published on June 15, 2022 at https://www.bpasjournals.com/)
Description
Description
Dr. G. Kavitha*
Author’s Affiliation : Assistant Professor, Selvamm Arts and Science College, Namakkal, Namakkal, Tamil Nadu 637003, India.
Corresponding Author : Dr. G. Kavitha, Assistant Professor, Selvamm Arts and Science College, Namakkal, Namakkal, Tamil Nadu 637003, India.,
E-Mail:-bwong8@singnet.com.sg
Abstract
Positive integers m1, m2, . . . , mk are studied in this work. If and merely if G can be articulated as the edge-disjoint union of Subgraphs (SGs) Fi, fulfilling c(Fi) £ mi, any graph G possess c(G) £ . By appropriate interpretations, the subsequent theorem is generalized to Hypergraphs (HGs) to infer propositions on the graph’s coverings.
How to cite this article:
Kavitha G. (2022). Chromatic Numbers of Hypergraphs. Bull. Pure Appl. Sci. Sect. E Math. Stat. 41E(1), 100-103.
Keywords
Hyper graph, Bipartite Graph, Edge Cut, Node Cut, Chromatic Number and k-colourable
