![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Conforti M. Hassin R. Ravi R.
Publisher: Elsevier
ISSN: 0167-6377
Source: Operations Research Letters, Vol.31, Iss.4, 2003-07, pp. : 273-276
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time
By Weihe K.
Journal of Algorithms, Vol. 23, Iss. 1, 1997-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Edge‐disjoint Hamilton cycles in random graphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Edge‐Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
JOURNAL OF GRAPH THEORY, Vol. 81, Iss. 1, 2016-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)