Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

2013

2013

The concept of the strongest path plays a crucial role in fuzzy graph theory. In classical graph theory, all paths in a graph are… Expand

2005

2005

Abstract.We prove that the Hubbard model at finite temperature T and half-filling is analytic in its coupling constant λ for… Expand

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

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

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

Highly Cited

1996

Highly Cited

1996

AbstractA graph with at least 2k vertices is said to bek-linked if, for any choices1,...,sk,t1,...,tkof 2k distinct vertices… Expand

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

1987

1987

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

1984

1984

A proof of Menger’s theorem is presented. We use the notation and terminology of Bondy and Murty [ll. Let D be a directed graph… Expand

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