3 citations · 8 across the 25 of their papers we have counts for
5 papers · 1 filter
The -binding function of -directional segment graphs
Lech Duraj, Ross J. Kang, Hoang La +4
Given a positive integer , the class -DIR is defined as all those intersection graphs formed from a finite collection of line segments in having at most s…
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…
On the minimum number of arcs in -dicritical oriented graphs
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
The dichromatic number of a digraph is the minimum number of colours needed to colour the vertices of a digraph such that each colour class induces an acyclic subdig…
On the minimum number of inversions to make a digraph -(arc-)strong
Julien Duron, Frédéric Havet, Florian Hörsch +1
The {\it inversion} of a set of vertices in a digraph consists of reversing the direction of all arcs of . We study (resp. ) whic…
Neighborhood complexity of planar graphs
Gwenaël Joret, Clément Rambaud
Reidl, Sánchez Villaamil, and Stravopoulos (2019) characterized graph classes of bounded expansion as follows: A class closed under subgraphs has bounded expansion if…