Author： Tsin Yung H.
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.40, Iss.2, 2007-02, pp. : 125-142
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
Nowhere-zero 15-flow in 3-edge-connected bidirected graphs
Acta Mathematica Sinica, Vol. 30, Iss. 4, 2014-04 ,pp. :
Access to resources
Recommend
Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks
By Kochol M.
Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. :
A SIMPLE ALGORITHM FOR DEDUCTION
ANZIAM Journal, Vol. 51, Iss. 1, 2009-07 ,pp. :
On the Structure of 3-connected Matroids and Graphs
European Journal of Combinatorics, Vol. 21, Iss. 5, 2000-07 ,pp. :
A Simple and Fast Min-Cut Algorithm
Theory of Computing Systems, Vol. 41, Iss. 2, 2007-08 ,pp. :