DOIAbstract
AbstractWe prove that for every n,m≥6, the complete bipartite graph Kn,m has at least 18nm2⌊(n−1)/3⌋⌊(m−2)/4⌋ nonisomorphic orientable as well as nonorientable genus embeddings
AbstractWe prove that for every n,m≥6, the complete bipartite graph Kn,m has at least 18nm2⌊(n−1)/3⌋⌊(m−2)/4⌋ nonisomorphic orientable as well as nonorientable genus embeddings
AbstractIt is shown that for every i∈{1,2,…,11}\{3,4,7} the complete graph K12s+i for s⩾d(i)∈{1,2,3,...
AbstractWe prove that the number of non-isomorphic face 2-colourable triangulations of the complete ...
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and ...
AbstractWe prove that for every n,m≥6, the complete bipartite graph Kn,m has at least 18nm2⌊(n−1)/3⌋...
AbstractIt is shown that there are constants M and c such that for n⩾M the number of nonisomorphic n...
AbstractWe show that for s≥11 there are at least 22s−11 nonisomorphic orientable triangular embeddin...
AbstractWe prove that, for a certain positive constant a and for an infinite set of values of n, the...
AbstractWe prove a theorem that for an integer s⩾0, if 12s+7 is a prime number, then the number of n...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
AbstractIn 1976, Stahl and White conjectured that the nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
AbstractIt was proved earlier that there are constants M, c>0 such that for every n⩾M (resp., every ...
AbstractIn an earlier paper the authors showed that with one exception the nonorientable genus of th...
AbstractKm,n is the complete bipartite graph with m and n vertices in its chromatic classes. G. Ring...
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
AbstractIt is shown that for every i∈{1,2,…,11}\{3,4,7} the complete graph K12s+i for s⩾d(i)∈{1,2,3,...
AbstractWe prove that the number of non-isomorphic face 2-colourable triangulations of the complete ...
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and ...
AbstractWe prove that for every n,m≥6, the complete bipartite graph Kn,m has at least 18nm2⌊(n−1)/3⌋...
AbstractIt is shown that there are constants M and c such that for n⩾M the number of nonisomorphic n...
AbstractWe show that for s≥11 there are at least 22s−11 nonisomorphic orientable triangular embeddin...
AbstractWe prove that, for a certain positive constant a and for an infinite set of values of n, the...
AbstractWe prove a theorem that for an integer s⩾0, if 12s+7 is a prime number, then the number of n...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
AbstractIn 1976, Stahl and White conjectured that the nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
AbstractIt was proved earlier that there are constants M, c>0 such that for every n⩾M (resp., every ...
AbstractIn an earlier paper the authors showed that with one exception the nonorientable genus of th...
AbstractKm,n is the complete bipartite graph with m and n vertices in its chromatic classes. G. Ring...
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
AbstractIt is shown that for every i∈{1,2,…,11}\{3,4,7} the complete graph K12s+i for s⩾d(i)∈{1,2,3,...
AbstractWe prove that the number of non-isomorphic face 2-colourable triangulations of the complete ...
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and ...
Add to ORKG