◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

János Barát

1 paper here

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

author position
  • first author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • math.CO1
ORCID 0000-0002-8474-487X

identity via Semantic Scholar / OpenAlex

most citedBounded-Degree Graphs have Arbitrarily Large Geometric Thickness

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

collaborators

1 paper

math.CO2005★ 10 cited

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness

Janos Barat, Jiri Matousek, David R. Wood

The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separa…

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