◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Ekstein

7 papers hereh-index 8174 citations15 works total

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

author position
  • first author4
  • middle author3

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

fields
  • math.CO6
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20112025
most cited3-coloring triangle-free planar graphs with a precolored 9-cycle

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

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.DM2011

Packing Chromatic Number of Distance Graphs

Jan Ekstein, Přemysl Holub, Bernard Lidický

The packing chromatic number χρ​(G) of a graph G is the smallest integer k such that vertices of G can be partitioned into disjoint classes X1​,...,Xk​ where vertices i…

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