2 citations · 4 across the 5 of their papers we have counts for
5 papers
Toughness and prism-hamiltonicity of -free graphs
M. N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan
The \emph{prism} over a graph is the product , i.e., the graph obtained by taking two copies of and adding a perfect matching joining the two copies of each ver…
The Chvátal-Erdős condition for prism-Hamiltonicity
M. N. Ellingham, Pouria Salehi Nowbandegani
The prism over a graph is the cartesian product . It is known that the property of having a Hamiltonian prism (prism-Hamiltonicity) is stronger than that of having…
Intersections, circuits, and colorability of line segments
Boris Brimkov, Jesse Geneson, Alathea Jensen +2
We derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the numbe…
All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs
Haibo Wu, Colton Magnant, Pouria Salehi Nowbandegani +1
Gallai-colorings are edge-colored complete graphs in which there are no rainbow triangles. Within such colored complete graphs, we consider Ramsey-type questions, looking for speci…
On the Erdős-Gyárfás conjecture in claw-free graphs
Pouria Salehi Nowbandegani, Hossein Esfandiari, Mohammad Hassan Shirdareh Haghighi +1
The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from re…