Reem Mahmoud

activity

20212026

most cited5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles

3 citations · 5 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2026

Obstructions for Minor-Closed Classes of limiting Densities Below 3/2

Antonios Kominatos, Reem Mahmoud, Dimitrios M. Thilikos

Given a graph class $G$ , the limiting density of $G$ is defined as $δ (G) = lim_{n \to \infty} ex (G, n) / n$ where $\mathsf{ex}(\mathcal{G…

math.CO2025

Equitably Coloring Planar and Outerplanar Graphs

Daniel W. Cranston, Reem Mahmoud

A proper $s$ -coloring of an $n$ -vertex graph is \emph{equitable} if every color class has size $⌊ n / s ⌋$ or $⌈ n / s ⌉$ . A necessary condition to have an equita…

math.CO2023★ 1 cited

Equitable Coloring in 1-Planar Graphs

Daniel Cranston, Reem Mahmoud

For every $r \geq 13$ , we show every 1-planar graph $G$ with $Δ (G) \leq r$ has an equitable $r$ -coloring.

math.CO2022

Kempe Equivalent List Colorings Revisited

Dibyayan Chakraborty, Carl Feghali, Reem Mahmoud

A \emph{Kempe chain} on colors $a$ and $b$ is a component of the subgraph induced by colors $a$ and $b$ . A \emph{Kempe change} is the operation of interchanging the colors of some…

math.CO2022

Reconstruction and Edge Reconstruction of Triangle-free Graphs

Alexander Clifton, Xiaonan Liu, Reem Mahmoud +1

The Reconstruction Conjecture due to Kelly and Ulam states that every graph with at least 3 vertices is uniquely determined by its multiset of subgraphs ${G - v : v \in V (G)}$ . Let $…

math.CO2022★ 3 cited

5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles

Daniel W. Cranston, Reem Mahmoud

The coloring reconfiguration graph $C_{k} (G)$ has as its vertex set all the proper $k$ -colorings of $G$ , and two vertices in $C_{k} (G)$ are adjacent if their corres…