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

2003

Highly Cited

2003

This paper contains the cornerstone theorem of the series. We study the structure of graphs with no minor isomorphic to a fixed… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Abstract In an earlier paper, the first two authors proved that for any planar graph H , every graph with no minor isomorphic to… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdos, A. L… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Answering a question of Rosenstiehl and Tarjan, we show that every plane graph withn vertices has a Fáry embedding (i.e… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

We show that each plane graph of order n 2 3 has a straight line embedding on the n-2 by n-2 grid. This embedding is computable… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructed… Expand

Is this relevant?

Highly Cited

1983

Highly Cited

1983

This paper describes a general technique that can be used to obtain approximation algorithms for various NP-complete problems on… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the… Expand

Is this relevant?

Highly Cited

1977

Highly Cited

1977

Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge… Expand

Is this relevant?

Highly Cited

1976

Highly Cited

1976

A data structure called a PQ-tree is introduced. PQ-trees can be used to represent the permutations of a set U in which various… Expand

Is this relevant?