1. Non-separable and planar graphs;Whitney;Trans. Amer. Math. Soc.,1932
2. V. Nall, Reduced k-to-1 maps and graphs with no k-to-1 cut set, Topology Appl., to appear
3. Combinatorial Problems Exercises;Lovász,1979
4. Ear decompositions of matching-covered graphs;Lovász;Combinatorica,1983
5. Computing ears branchings in parallel;Lovász,1985