◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Jahanbekam

12 papers hereh-index 8280 citations36 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author1
  • middle author8
  • last author2

Across the 12 of 12 papers where every author was matched, so the position is known.

fields
  • math.CO11
  • cs.DS1

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedThe chromatic number of the square of subcubic planar graphs

24 citations · 31 across the 10 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

math.CO2021

3-colorability of graphs with minimum degree at least 6

Nicholas Crawford, Sogol Jahanbekam

Let G be an n-vertex graph and let L:V(G)→P({1,2,3}) be a list assignment over the vertices of G, where each vertex with list of size 3 and of degree at most 5…

math.CO2021

Characterization of Graphs with Villainy 2

Sogol Jahanbekam, Meng-Ru Lin

Let f be an optimal proper coloring of a graph G and let c be a coloring of the vertices of G obtained by permuting the colors on vertices in the proper coloring f. The v…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.