On the excluded minors for matroids of branch-width three.
New infinite families of almost-planar crossing-critical graphs.
A note on intersection dimensions of graph classes
The intersection dimension of a graph with respect to a class of graphs is the minimum such that is the intersection of some graphs on the vertex set belonging to . In this paper we follow [ Kratochv’ıl J., Tuza Z.: , Graphs and Combinatorics 10 (1994), 159–168 ] and show that for some pairs of graph classes , the intersection dimension of graphs from with respect to is unbounded.
Page 1