AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for compact orientable 2-manifolds N in which G has a 2-cell imbedding. Several general results are established concerning the parameter γM(G), and the maximum genus of the complete graph Kn with n vertices is determined: γM(Kn) = (n − 1)(n − 2)
summary:In this paper we determine the maximum genus of a graph by using the matching number of the ...
AbstractA relative embedding of a graph in a surface with respect to a set of closed walks is one wh...
AbstractIt is shown that ⌈β(G)/3⌉ is the tight lower bound on the maximum genus γM(G) of 2-edge-conn...
AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for ...
AbstractThe maximum genus, γM(G), of a connected graph G is the largest genus γ(S) for orientable su...
AbstractThe maximum genus of a connected graph G is the maximum among the genera of all compact orie...
AbstractLet G be a (finite) graph of diameter two. We prove that if G is loopless then it is upper e...
The maximum genus gamma_M(G) of a graph G is the largest genus of an orientable surface into which G...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
summary:In this paper we determine the maximum genus of a graph by using the matching number of the ...
AbstractA signed graph is a graph in which each edge is labelled with a sign. A cycle C of a signed ...
AbstractLet G be a finite connected graph. The genus of G, denoted by γ(G), is the least integer n s...
AbstractLet G be a graph that is cellularly embedded in the projective plane such that the dual grap...
AbstractA relative embedding of a graph in a surface with respect to a set of closed walks is one wh...
summary:In this paper we determine the maximum genus of a graph by using the matching number of the ...
summary:In this paper we determine the maximum genus of a graph by using the matching number of the ...
AbstractA relative embedding of a graph in a surface with respect to a set of closed walks is one wh...
AbstractIt is shown that ⌈β(G)/3⌉ is the tight lower bound on the maximum genus γM(G) of 2-edge-conn...
AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for ...
AbstractThe maximum genus, γM(G), of a connected graph G is the largest genus γ(S) for orientable su...
AbstractThe maximum genus of a connected graph G is the maximum among the genera of all compact orie...
AbstractLet G be a (finite) graph of diameter two. We prove that if G is loopless then it is upper e...
The maximum genus gamma_M(G) of a graph G is the largest genus of an orientable surface into which G...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
summary:In this paper we determine the maximum genus of a graph by using the matching number of the ...
AbstractA signed graph is a graph in which each edge is labelled with a sign. A cycle C of a signed ...
AbstractLet G be a finite connected graph. The genus of G, denoted by γ(G), is the least integer n s...
AbstractLet G be a graph that is cellularly embedded in the projective plane such that the dual grap...
AbstractA relative embedding of a graph in a surface with respect to a set of closed walks is one wh...
summary:In this paper we determine the maximum genus of a graph by using the matching number of the ...
summary:In this paper we determine the maximum genus of a graph by using the matching number of the ...
AbstractA relative embedding of a graph in a surface with respect to a set of closed walks is one wh...
AbstractIt is shown that ⌈β(G)/3⌉ is the tight lower bound on the maximum genus γM(G) of 2-edge-conn...
DOI
Add to ORKG