A graph is 2-degenerate if every subgraph contains a vertex of degree at...
For a class 𝒟 of drawings of loopless multigraphs in the plane, a
drawin...
We study noncrossing geometric graphs and their disjoint compatible geom...
The interval number of a graph G is the minimum k such that one can
assi...
We define the induced arboricity of a graph G, denoted by ia(G), as
the...
An ordered graph is a graph equipped with a linear ordering of its verte...