3 papers
math.CO2025
Rainbow Turán numbers for short brooms
John Byrne, E. G. K. M Gamlath, Anastasia Halfpap +2
A graph is rainbow--free if it admits a proper edge-coloring without a rainbow copy of . The rainbow Turán number of , denoted , is the maximum num…
math.CO2024
Independent Bondage Number in Graphs under Girth Constraints
E. G. K. M. Gamlath, Andrew Pham, Bing Wei
Given a finite, simple graph , the independent bondage number of is the minimum size of an edge set such that its deletion results in a graph with strictly larger independen…
math.CO2024
Graph Configurations and Independent Bondage Numbers of Planar Graphs
E. G. K. M. Gamlath, Bing Wei, Talmage James Reid
The independent domination number of a finite graph G is the minimum cardinality of an independent dominating set of vertices. The independent bondage number of G is the minimum ca…