In mathematics graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in… (More)

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

Highly Cited

2005

Highly Cited

2005

- Andrew V. Goldberg, Chris Harrelson
- SODA
- 2005

We study the problem of finding a shortest path between two vertices in a directed graph. This is an important problem with many… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
- 46th Annual IEEE Symposium on Foundations of…
- 2005

At the core of the seminal graph minor theory of Robertson and Seymour is a powerful structural theorem capturing the structure… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Jonathan L. Gross
- Discrete mathematics and its applications
- 2004

The “CRC Handbook” is well-known to anyone who has taken a college chemistry course, and CRC Press has traded on this name… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Christopher D. Godsil, Gordon F. Royle
- Graduate texts in mathematics
- 2001

Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Steven Skiena
- 1990

Many people are trying to be smarter every day. How's about you? There are many ways to evoke this case you can find knowledge… (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Carsten Thomassen
- Journal of Graph Theory
- 1986

At the occasion of the 250th anniversary of graph theory, we recall some of the basic results and unsolved problems, some of the… (More)

Is this relevant?

Highly Cited

1966

Highly Cited

1966

- P. L. Erdos, M. SIMOINOVITS
- 1966

In this paper G(n ; I) will denote a graph of n vertices and l edges, K " will denote the complete graph of p vertices G (p ; (PA… (More)

Is this relevant?

Highly Cited

1966

Highly Cited

1966

- P. L. Erdos, A. RÉNYII, V. T. Sós
- 1966

Let G " be a non-directed graph having n vertices, without parallel edges and slings. Let the vertices of Gn be denoted by F 1… (More)

Is this relevant?

Highly Cited

1963

Highly Cited

1963

- By W. T. TUTTE
- 1963

W E use the definitions of (11). However, in deference to some recent attempts to unify the terminology of graph theory we… (More)

Is this relevant?

Highly Cited

1957

Highly Cited

1957

- 1’. ERDOS
- 1957

A well-known theorem of Ramsay (8; 9) states that to every n there exists a smallest integer g(n) so that every graph of g(n… (More)

Is this relevant?