default search action
Sogol Jahanbekam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j18]Zhanar Berikkyzy, Beth Bjorkman, Heather C. Smith Blake
, Sogol Jahanbekam, Lauren Keough, Kevin Moss, Danny Rorabaugh, Songling Shan:
Triangle-degree and triangle-distinct graphs. Discret. Math. 347(1): 113695 (2024) - [j17]Caroline Accurso, Vitaliy Chernyshov, Leaha Hand, Sogol Jahanbekam
Weak Dynamic Coloring of Planar Graphs. Graphs Comb. 40(2): 27 (2024) - 2021
- [j16]Nicholas Crawford, Sogol Jahanbekam
Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7. Discret. Appl. Math. 298: 80-83 (2021) - [j15]Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam, Victor Larsen, Danny Rorabaugh:
List-antimagic labeling of vertex-weighted graphs. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - 2020
- [j14]Axel Brandt, Sogol Jahanbekam, Jennifer White:
Additive list coloring of planar graphs with given girth. Discuss. Math. Graph Theory 40(3): 855-873 (2020) - 2019
- [j13]Michael Ferrara, Zoltán Füredi, Sogol Jahanbekam
List-distinguishing Cartesian products of cliques. Discret. Math. 342(7): 2012-2022 (2019) - 2018
- [j12]Philip DeOrsey, Michael Ferrara, Nathan Graber, Stephen G. Hartke, Luke L. Nelsen, Eric Sullivan, Sogol Jahanbekam, Bernard Lidický, Derrick Stolee, Jennifer White:
On the Strong Chromatic Index of Sparse Graphs. Electron. J. Comb. 25(3): 3 (2018) - 2016
- [j11]Sogol Jahanbekam
On r-dynamic coloring of graphs. Discret. Appl. Math. 206: 65-72 (2016) - [j10]Sogol Jahanbekam
Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs. Graphs Comb. 32(2): 707-712 (2016) - [j9]Sogol Jahanbekam
Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees. J. Graph Theory 82(1): 75-89 (2016) - 2015
- [j8]Jennifer Diemunsch, Michael Ferrara, Sogol Jahanbekam
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem. SIAM J. Discret. Math. 29(4): 2088-2099 (2015) - 2014
- [j7]Saieed Akbari, Maryam Ghanbari, Sogol Jahanbekam:
On the Dynamic Coloring of Strongly Regular Graphs. Ars Comb. 113: 205-210 (2014) - [j6]Saieed Akbari, Maryam Ghanbari, Sogol Jahanbekam:
On the Dynamic Coloring of Cartesian Product Graphs. Ars Comb. 114: 161-168 (2014) - [j5]Daniel W. Cranston
The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs. Discuss. Math. Graph Theory 34(4): 769-799 (2014) - 2013
- [j4]Csaba Biró, Zoltán Füredi, Sogol Jahanbekam
Large Chromatic Number and Ramsey Graphs. Graphs Comb. 29(5): 1183-1191 (2013) - 2009
- [j3]Sogol Jahanbekam
A comment to: Two classes of edge domination in graphs. Discret. Appl. Math. 157(2): 400-401 (2009) - [j2]Saieed Akbari
On the list dynamic coloring of graphs. Discret. Appl. Math. 157(14): 3005-3007 (2009) - [j1]Saieed Akbari
List coloring of graphs having cycles of length divisible by a given number. Discret. Math. 309(3): 613-614 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: