%0 Journal Article
%A Nebeský, Ladislav
%T Characterizing the maximum genus of a connected graph
%J Czechoslovak Mathematical Journal
%D 1993
%P 177-185
%V 43
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128386/
%R 10.21136/CMJ.1993.128386
%G en
%F 10_21136_CMJ_1993_128386