◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

B. Brešar

41 papers hereh-index 292.8k citations178 works total

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

author position
  • first author36
  • middle author5

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

fields
  • math.CO41

identity via Semantic Scholar / OpenAlex

activity
20092026
most citedMinimum k-path vertex cover

167 citations · 214 across the 24 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

math.CO2021

The independence coloring game on graphs

Boštjan Brešar, Daša Štesl

We propose a new coloring game on a graph, called the independence coloring game, which is played by two players with opposite goals. The result of the game is a proper coloring of…

math.CO2021

The geodesic-transversal problem

Paul Manuel, Boštjan Brešar, Sandi Klavžar

A maximal geodesic in a graph is a geodesic (alias shortest path) which is not a subpath of a longer geodesic. The geodesic-transversal problem in a graph G is introduced as the…

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