![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Li Jianping Steiner George
Publisher: Akademiai Kiado
ISSN: 0081-6906
Source: Studia Scientiarum Mathematicarum Hungarica, Vol.42, Iss.3, 2005-08, pp. : 277-294
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)
Selecting vertex disjoint paths in plane graphs
NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 2, 2015-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Reconstructing edge-disjoint paths
By Conforti M. Hassin R. Ravi R.
Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Disjoint Triangles of a Cubic Line Graph
By Zhang Xiao-Dong Bylka Stanislaw
Graphs and Combinatorics, Vol. 20, Iss. 2, 2004-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 4, 2015-08 ,pp. :