On the list dynamic coloring of graphs. - Saieed Akbari; Maryam Ghanbari; Sogol Jahanbekam (Discret. Appl. Math., 2009)

A comment to: Two classes of edge domination in graphs. - Sogol Jahanbekam (Discret. Appl. Math., 2009)

List coloring of graphs having cycles of length divisible by a given number. - Saieed Akbari; Maryam Ghanbari; Sogol Jahanbekam; M. Jamaali (Discret. Math., 2009)

Large Chromatic Number and Ramsey Graphs. - Csaba Biró; Zoltán Füredi; Sogol Jahanbekam (Graphs Comb., 2013)

On the Dynamic Coloring of Strongly Regular Graphs. - Saieed Akbari; Maryam Ghanbari; Sogol Jahanbekam (Ars Comb., 2014)

On the Dynamic Coloring of Cartesian Product Graphs. - Saieed Akbari; Maryam Ghanbari; Sogol Jahanbekam (Ars Comb., 2014)

The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs. - Daniel W. Cranston; Sogol Jahanbekam; Douglas B. West (Discuss. Math. Graph Theory, 2014)

Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem. - Jennifer Diemunsch; Michael Ferrara; Sogol Jahanbekam; James M. Shook (SIAM J. Discret. Math., 2015)

On r-dynamic coloring of graphs. - Sogol Jahanbekam; Jaehoon Kim; Suil O; Douglas B. West (Discret. Appl. Math., 2016)

Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs. - Sogol Jahanbekam; Douglas B. West (Graphs Comb., 2016)

Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees. - Sogol Jahanbekam; Douglas B. West (J. Graph Theory, 2016)

On the Strong Chromatic Index of Sparse Graphs. - Philip DeOrsey; Michael Ferrara; Nathan Graber; Stephen G. Hartke; Luke L. Nelsen; Eric Sullivan; Sogol Jahanbekam; Bernard Lidický; Derrick Stolee; Jennifer White (Electron. J. Comb., 2018)

List-distinguishing Cartesian products of cliques. - Michael Ferrara; Zoltán Füredi; Sogol Jahanbekam; Paul S. Wenger (Discret. Math., 2019)

Additive list coloring of planar graphs with given girth. - Axel Brandt; Sogol Jahanbekam; Jennifer White (Discuss. Math. Graph Theory, 2020)

Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7. - Nicholas Crawford; Sogol Jahanbekam; Katerina Potika (Discret. Appl. Math., 2021)

List-antimagic labeling of vertex-weighted graphs. - Zhanar Berikkyzy; Axel Brandt; Sogol Jahanbekam; Victor Larsen; Danny Rorabaugh (Discret. Math. Theor. Comput. Sci., 2021)

Triangle-degree and triangle-distinct graphs. - Zhanar Berikkyzy; Beth Bjorkman; Heather C. Smith Blake; Sogol Jahanbekam; Lauren Keough; Kevin Moss; Danny Rorabaugh; Songling Shan (Discret. Math., 2024)

Weak Dynamic Coloring of Planar Graphs. - Caroline Accurso; Vitaliy Chernyshov; Leaha Hand; Sogol Jahanbekam; Paul S. Wenger (Graphs Comb., 2024)