Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Back to Simple Search

Advanced Search

Match of the following rules

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 3 of 3

Order by Relevance | Title | Year of publication

On the excluded minors for matroids of branch-width three.

Hliněný, Petr — 2002

The Electronic Journal of Combinatorics [electronic only]

New infinite families of almost-planar crossing-critical graphs.

Hlineny, Petr — 2008

The Electronic Journal of Combinatorics [electronic only]

A note on intersection dimensions of graph classes

Petr Hliněný; Aleš Kuběna — 1995

Commentationes Mathematicae Universitatis Carolinae

The intersection dimension of a graph $G$ with respect to a class $𝒜$ of graphs is the minimum $k$ such that $G$ is the intersection of some $k$ graphs on the vertex set $V (G)$ 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

Download Results (CSV)