Publisher： John Wiley & Sons Inc
E-ISSN： 1097-0118|81|1|16-29
ISSN： 0364-9024
Source： JOURNAL OF GRAPH THEORY, Vol.81, Iss.1, 2016-01, pp. : 16-29
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
Edge‐disjoint Hamilton cycles in random graphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. :
Access to resources
Recommend
Reconstructing edge-disjoint paths
By Conforti M. Hassin R. Ravi R.
Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. :
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. :
Local edge and local node connectivity in regular graphs
By Fülöp O.
Studia Scientiarum Mathematicarum Hungarica, Vol. 40, Iss. 1-2, 2003-07 ,pp. :