2 papers
math.CO2026
Partitions and covers in convexity
Bijo S. Anand, Manoj Changat, Mitre C. Dourado +2
Given a graph and a set , we say that is -convex if the neighborhood of every vertex not in is an independent set. A collection ${\cal V} = (V_1,…
math.CO2025
Carathodory Number and Exchange Number in -convexity
Bijo S. Anand, Arun Anil, Manoj Changat +2
Given a graph , a set is -convex if there is no vertex forming a triangle with two vertices of . The -convex hull of is the minimum -co…