47 citations
- Vrije Universiteit BrusselBE57 papers
- Sungkyunkwan UniversityKR56 papers
- University of Maryland, College ParkUS55 papers
- UCLouvainBE53 papers
- Massachusetts Institute of TechnologyUS52 papers
- University of PaduaIT51 papers
- Université Paris-SaclayFR50 papers
- University of California SystemUS50 papers
- The Ohio State UniversityUS49 papers
- University of KansasUS49 papers
- Université de StrasbourgFR48 papers
- University of Wisconsin–MadisonUS48 papers
4 papers · 1 filter
The grid-minor theorem revisited
Vida DujmoviÄ, Robert Hickingbotham, JÄdrzej Hodor +6
We prove that for every planar graph of treedepth , there exists a positive integer such that for every -minor-free graph , there exists a graph of treewidth a…
ErdÅs--Pósa property of cycles that are far apart
Vida DujmoviÄ, Gwenaël Joret, Piotr Micek +1
We prove that there exist functions such that for all nonnegative integers and , for every graph , either contains cycles such that…
Fractional list packing for layered graphs
Stijn Cambie, Wouter Cames van Batenburg
The fractional list packing number of a graph is a graph invariant that has recently arisen from the study of disjoint list-colourings. It measures how…
Computing the degreewidth of a digraph is hard
Pierre Aboulker, Nacim Oijid, Robin Petit +2
Given a digraph, an ordering of its vertices defines a backedge graph, namely the undirected graph whose edges correspond to the arcs pointing backwards with respect to the order.…