Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2012

Highly Cited

2012

Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by… Expand

Is this relevant?

2011

2011

In an objective lens driving unit, an objective lens (12) is fixed to a coil bobbin (11), which has a focus drive coil (13a… Expand

Is this relevant?

2011

2011

In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor isomorphic to U"2","5, U"3","5… Expand

Is this relevant?

2011

2011

We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.

Is this relevant?

2010

2010

A minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism and under taking minors. For a minor… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is… Expand

Is this relevant?

2009

2009

A lattice path matroid is a transversal matroid for which some antichain of intervals in some linear order on the ground set is a… Expand

Is this relevant?

2009

2009

A minor-closed class of graphs is addable if each excluded minor is 2-connected. We see that such a class of labelled graphs has… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

The rank-width is a graph parameter related in terms of fixed functions to clique-width but more tractable. Clique-width has nice… Expand

Is this relevant?

1992

1992

Given a graph and a length function defined on its edge-set, the Traveling Salesman Problem can be described as the problem of… Expand

Is this relevant?