Showing 2018 · math.COShow all
2 papers · 2 filters
math.CO2018
The interval number of a planar graph is at most three
Guillaume Guégan, Kolja Knauer, Jonathan Rollin +1
The interval number of a graph is the minimum such that one can assign to each vertex of a union of intervals on the real line, such that is the intersection gr…
math.CO2018
Induced and Weak Induced Arboricities
Maria Axenovich, Philip Dörr, Jonathan Rollin +1
We define the induced arboricity of a graph , denoted by , as the smallest such that the edges of can be covered with induced forests in . This notio…