Recent results on well-balanced orientations

The Planar Hamiltonian Circuit Problem is NP-Complete

M. R. Garey, D. S. Johnson, Robert E. Tarjan · SIAM Journal on Computing · 1976 · 529 citations

Computing, Computer Science, Mathematics +7

On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs

C. St. J. A. Nash‐Williams · Canadian Journal of Mathematics · 1960 · 163 citations · Full text

Natural Sciences, Mathematics, Combinatorics +7

On the orientation of graphs

András Frank · Journal of Combinatorial Theory Series B · 1980 · 91 citations

Natural Sciences, Computer Science, Mathematics +4

On a theorem of Mader

András Frank · Discrete Mathematics · 1992 · 65 citations

Natural Sciences, Mathematics, Intellectual Property +1

Efficient splitting off algorithms for graphs

Harold N. Gabow · 1994 · 56 citations · Full text

Computing, Computer Science, Algorithms +4