3 papers
math.CO2026
Bounds and Hardness Results for Conflict-free Choosability
Shiwali Gupta, Rogers Mathew
A '(partial) conflict-free coloring' of a hypergraph is an assignment of colors to (a subset of) the vertex set of such that every hyperedge in $\mathca…
math.CO2026
Computational and Combinatorial Results on Conflict-free Choosability
Shiwali Gupta, Rogers Mathew
The conflict-free closed neighborhood (CFCN) chromatic number of a graph is the smallest positive integer for which there exists a coloring of a subset of verti…
math.CO2026
Towards a conjecture on long induced rainbow paths in triangle-free graphs
N. R. Aravind, Shiwali Gupta, Rogers Mathew
Given a triangle-free graph with chromatic number and a proper vertex coloring of , it is conjectured that contains an induced rainbow path on vertices unde…