226 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of TorontoCA33 papers
- Rutherford Appleton LaboratoryGB32 papers
- Tel Aviv UniversityIL32 papers
- University of FreiburgDE32 papers
- University of OxfordGB32 papers
- Sapienza University of RomeIT31 papers
- The Ohio State UniversityUS31 papers
- University College LondonGB31 papers
- University of AmsterdamNL31 papers
- University of BonnDE31 papers
- University of GlasgowGB31 papers
- Weizmann Institute of ScienceIL31 papers
4 papers · 1 filter
Local girth choosability of planar graphs
Luke Postle, Evelyne Smith-Roberge
In 1994, Thomassen famously proved that every planar graph is 5-choosable, resolving a conjecture initially posed by Vizing and, independently, Erd\H{os}, Rubin, and Taylor in the…
Long monotone trails in random edge-labelings of random graphs
Omer Angel, Asaf Ferber, Benny Sudakov +1
Given a graph and a bijection , we say that a trail/path in is -\emph{increasing} if the labels of consecutive edges of this t…
To catch a falling robber
William B. Kinnersley, Paweł Prałat, Douglas B. West
We consider a Cops-and-Robber game played on the subsets of an -set. The robber starts at the full set; the cops start at the empty set. On each turn, the robber moves down one…
Minimal obstructions for 1-immersions and hardness of 1-planarity testing
Vladimir P. Korzhik, Bojan Mohar
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar gra…