3 papers
cs.DS2025
Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
Therese Biedl, Prosenjit Bose, Karthik Murali
Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of thi…
math.CO2024
The basis number of 1-planar graphs
Saman Bazargani, Therese Biedl, Prosenjit Bose +2
Let be a set of Eulerian subgraphs of a graph . We say forms a -basis if it is a minimum set that generates the cycle space of , and any edge of lies in at mos…
math.CO2024
On the -independence number in 1-planar graphs
Therese Biedl, Prosenjit Bose, Babak Miraftab
The -independence number of a graph is the largest possible size of an independent set in where each vertex of has degree at least in . Upper bounds for t…