Tapas Kumar Mishra

activity

20152022

(r, p)

-coloring of hypergraphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2015

Strong $(r, p)$ Cover for Hypergraphs

Tapas Kumar Mishra, Sudebkumar Prasant Pal

We introduce the notion of the { \it strong $(r, p)$ cover} number $χ^{c} (G, k, r, p)$ for $k$ -uniform hypergraphs $G (V, E)$ , where $χ^{c} (G, k, r, p)$ denotes the minimum number of $r$ -colori…

cs.DM2015★ 1 cited

An extremal problem in proper $(r, p)$ -coloring of hypergraphs

Tapas Kumar Mishra, Sudebkumar Prasant Pal

Let $G (V, E)$ be a $k$ -uniform hypergraph. A hyperedge $e \in E$ is said to be properly $(r, p)$ colored by an $r$ -coloring of vertices in $V$ if $e$ contains vertices of at least $p…

Strong (r,p) Cover for Hypergraphs

An extremal problem in proper (r,p)-coloring of hypergraphs

Strong $(r, p)$ Cover for Hypergraphs

An extremal problem in proper $(r, p)$ -coloring of hypergraphs