Sogol Jahanbekam

Orcid: 0000-0003-0948-5713

According to our database1, Sogol Jahanbekam authored at least 18 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Weak Dynamic Coloring of Planar Graphs.
Graphs Comb., April, 2024

Triangle-degree and triangle-distinct graphs.
Discret. Math., January, 2024

2021
List-antimagic labeling of vertex-weighted graphs.
Discret. Math. Theor. Comput. Sci., 2021

Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7.
Discret. Appl. Math., 2021

2020
Additive list coloring of planar graphs with given girth.
Discuss. Math. Graph Theory, 2020

2019
List-distinguishing Cartesian products of cliques.
Discret. Math., 2019

2018
On the Strong Chromatic Index of Sparse Graphs.
Electron. J. Comb., 2018

2016
Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees.
J. Graph Theory, 2016

Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs.
Graphs Comb., 2016

On r-dynamic coloring of graphs.
Discret. Appl. Math., 2016

2015
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem.
SIAM J. Discret. Math., 2015

2014
The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs.
Discuss. Math. Graph Theory, 2014

On the Dynamic Coloring of Cartesian Product Graphs.
Ars Comb., 2014

On the Dynamic Coloring of Strongly Regular Graphs.
Ars Comb., 2014

2013
Large Chromatic Number and Ramsey Graphs.
Graphs Comb., 2013

2009
List coloring of graphs having cycles of length divisible by a given number.
Discret. Math., 2009

A comment to: Two classes of edge domination in graphs.
Discret. Appl. Math., 2009

On the list dynamic coloring of graphs.
Discret. Appl. Math., 2009


  Loading...