◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Eslahchi

5 papers hereh-index 211.4k citations133 works total

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

author position
  • first author1
  • middle author3
  • last author1

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

fields
  • math.CO2
  • cs.CE1
  • cs.DS1
  • cs.LG1

identity via Semantic Scholar / OpenAlex

activity
19992024
most citedOn the number of outer connected dominating sets of graphs

9 citations · 21 across the 5 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2011★ 9 cited

On the number of outer connected dominating sets of graphs

Saeid Alikhani, Mohammad H. Akhbari, C. Eslahchi +1

Let G=(V,E) be a simple graph. A set S⊆V(G) is called an outer-connected dominating set (or ocd-set) of G, if S is a dominating set of G and either S=V(G) or $…

math.CO1999★ 8 cited

Some concepts in list coloring

Ch. Eslahchi, M. Ghebleh, H. Hajiabolhassan

In this paper uniquely list colorable graphs are studied. A graph G is called to be uniquely k-list colorable if it admits a k-list assignment from which G has a unique list colori…

◍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.