Results 1 
3 of
3
... Minors In Graphs Of Bounded TreeWidth
 J. Combin. Theory Ser. B
, 2000
"... It is shown that for any positive integers k and w there exists a ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
It is shown that for any positive integers k and w there exists a
Graph Minors and Graphs on Surfaces
, 2001
"... Graph minors and the theory of graphs embedded in surfaces are ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Graph minors and the theory of graphs embedded in surfaces are
Elimination of local bridges
 Math. Slovaca
, 1997
"... Let K be a subgraph of G. It is shown that if G is 3–connected modulo K then it is possible to replace branches of K by other branches joining same pairs of main vertices of K such that G has no local bridges with respect to the new subgraph K. A linear time algorithm is presented that either perfor ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
Let K be a subgraph of G. It is shown that if G is 3–connected modulo K then it is possible to replace branches of K by other branches joining same pairs of main vertices of K such that G has no local bridges with respect to the new subgraph K. A linear time algorithm is presented that either performs such a task, or finds a Kuratowski subgraph K5 or K3,3 in a subgraph of G formed by a branch e and local bridges on e. This result is needed in linear time algorithms for embedding graphs in surfaces.