Publications:​

​

Submitted

1. Caroline Accurso, Vitaliy Chernyshov, Leaha Hand, Sogol Jahanbekam, PaulWenger,Weak Dynamic

Coloring of Planar Graphs, submitted.

​

2. M. Ferrara, Z. Furedi, S. Jahanbekam, P. Wenger, ,List-distinguishing Cartesian Products of Cliques ,

submitted.

​

3. S. G. Hartke, S. Jahanbekam, and B. Thomas, The chromatic number of the square of subcubic planar

graphs, submitted.

​

4. Z. Berikkyzy, A. Brandt, S. Jahanbekam, V. Larsen, and D. Rorabaugh, Antimagic labeling of weighted

and oriented graphs, submitted.

​

​

Published

5. A. Brandt, J. White, and S. Jahanbekam, Bounds for the lucky choice number of planar graphs

with specified girth, Discussiones Mathematicae Graph Theory  (2018).

​

6. P. DeOrsey, J. Diemunsch, M. Ferrara, N. Graber, S. G. Hartke, S. Jahanbekam, B. Lidicky, L. Nelsen,

D. Stolee and E. Sullivan, On the strong chromatic index of sparse graphs, Elec. J. Combin. 25 (2018).

​

7. S. Jahanbekam and D. B. West, Anti-Ramsey problems for t edge-disjoint rainbow spanning subgraphs:

cycles, matchings, or trees,  Journal of Graph Theory, y 82 (2016), 75–89.

​

8. S. Jahanbekam and D. B. West, Rainbow spanning subgraphs of small diameter in edge-colored

complete graphs,  Graphs and Combinatorics, 32 (2016), 707–712.

​

9. S. Jahanbekam, J. Kim, S. O, and D. B. West, On r-dynamic coloring of graphs,  Discrete Applied

Mathematics, Discrete Appl. Math. 206 (2016), 65–72.

​

10. J. Diemunsch, M. J. Ferrara, S. Jahanbekam, and J. Shook, Extremal theorems for degree sequence

packing and the 2-color discrete tomography problem,  SIAM Journal of Discrete Mathematics, 29 (2015),

no. 4, 2088-2099.

​

11. D. B. Cranston, S. Jahanbekam, D. B. West, 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs,

 Discussiones Mathematicae Graph Theory, 34 (2014), 769-799.

​

12. S. Akbari, M. Ghanbari, and S. Jahanbekam, On the dynamic coloring of strongly regular graphs,

 Ars Combinatoria 113, 205–210, (2014).

​

13. S. Akbari, M. Ghanbari, and S. Jahanbekam, On the dynamic coloring of Cartesian product graphs,

 Ars Combinatoria 114, 161–168, (2014).

​

14. C. Biró, Z. Füredi, and S. Jahanbekam, Large chromatic number and Ramsey graphs,  Graphs and

Combinatorics, Volume 29, Issue 5, 1183–1191 (2013).

​

15. S. Jahanbekam and D. B. West, New lower bounds for matching numbers of general and bipartite

graphs,  Congressus Numerantium 218, 57–59 (2013).

​

16. S. Akbari, M. Ghanbari, and S. Jahanbekam, On the dynamic chromatic number of graphs,  Combinatorics

and graphs, 11–18, Contemp. Math., Amer. Math. Soc., Providence, RI, (2010).

​

17. S. Akbari, A. Doni, M. Ghanbari, S. Jahanbekam, and A. Saito, List coloring of graphs with cycles of

length divisible by a given integer,  Combinatorics and graphs, 117–125, Contemp. Math., Amer. Math.

Soc., Providence, RI, (2010).

​

18. S. Akbari, M. Ghanbari, S. Jahanbekam, On the List dynamic coloring of graphs,  Discrete Applied

Mathematics, 309, 613–614 (2009). (ranked third in Science Direct TOP25 Hottest Articles July -

September 2009)

 

19. S. Akbari, M. Ghanbari, S. Jahanbekam, and M. Jamaali, List coloring of graphs having cycles of

length divisible by a given number,  Discrete Mathematics, Volume 309, Issue 3, 613–614 (2009).

​

20. S. Jahanbekam, Two classes of edge domination in graphs,  Discrete Applied Mathematics, Vol. 157,

Issue 2, 400–401 (2009) (counterexample to a paper by B. Xu in Discrete Applied Mathematics).

​

Conference Papers

21. P. K. Gopalakrishnan, H. Kein, S. Jahanbekam, S. Behdad, Graph Partitioning Technique to Identify

Physically Integrated Design Concepts,  Proceedings of the ASME 2018  International Design Engineering

Technical Conferences & Computers and Information

​