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.

2005

2005

In the minimun path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to… Expand

Is this relevant?

2001

2001

Menger's Theorem for digraphs states that for any two vertex sets A and B of a digraph D such that A cannot be separated from B… Expand

Is this relevant?

2001

2001

Menger's Theorem for digraphs states that for any two vertex sets A and B of a digraph D such that A cannot be separated from B… Expand

Is this relevant?

2000

2000

Abstract A short proof of the classical theorem of Menger concerning the number of disjoint AB -paths of a finite digraph for two… Expand

Is this relevant?

1999

1999

We give necessary and sufficient regularity conditions under which the curve reconstruction problem is solved by a traveling… Expand

Is this relevant?

1995

1995

Olefinically unsaturated carbonyl compounds R1-CHR2-CHR3-C(R4)O (I) and alcohols R1-CHR2-CHR3-CH(R4)-OH (II) (where R1 is an… Expand

Is this relevant?

1991

1991

An(a, b)-n-fan means a union ofn internally disjoint paths. Menger's theorem states that a graphG has an(a, b)-n-fan if and only… Expand

Is this relevant?

1987

1987

The countable case of a conjecture of Erdos is settled: let G = (V, E) be a directed or undirected graph, where V is countable… Expand

Is this relevant?

1984

1984

In this paper we prove a Mengerian theorem for long paths, namely, that if in order to cut every uv-path of length at least n (n… Expand

Is this relevant?

1983

1983

Abstract Menger's theorem can be stated as follows: Let G = ( V , E ) be a finite graph, and let A and B be subsets of V . Then… Expand

Is this relevant?