4 citations · 9 across the 9 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023★ 1 cited
Equitable Coloring in 1-Planar Graphs
Daniel Cranston, Reem Mahmoud
For every , we show every 1-planar graph with has an equitable -coloring.
cs.CC2023
Minimum Separator Reconfiguration
Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud +4
We study the problem of reconfiguring one minimum --separator into another minimum --separator in some -vertex graph containing two non-adjacent vertices…
q-bio.GN2023★ 1 cited
Complexity and Enumeration in Models of Genome Rearrangement
Lora Bailey, Heather Smith Blake, Garner Cochran +8
In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the Pairwise Rearrangement problem in the Single Cu…