Add to ORKGGraphs that have two disjoint noncontractible cycles in every possible embedding in surfaces are characterized. Similar characterization is given for the class of graphs whose orientable embeddings (embeddings in surfaces different from the projective plane, respectively) always have two disjoint noncontractible cycles. For graphs which admit embeddings in closed surfaces without having two disjoint noncontractible cycles, such embeddings are structurally characterized. Academic Press, Inc
AbstractWe show that every 3-connected planar graph has a circular embedding in some nonspherical su...
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of ...
Abstract We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles...
AbstractGraphs that have two disjoint noncontractible cycles in every possible embedding in surfaces...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
AbstractIn a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bou...
AbstractWe prove that for any orientable surface S and any non-negative integer k, there exists an i...
AbstractIt is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere h...
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a suf...
It has been proved that in the orientable surface of genus g(g ≥ 2), the number of pairwise disjoint...
AbstractA polyhedral map on a surface is a 2-cell embedding of a connected graph on the surface such...
Two 2-cell embeddings A +/-: X -> S and j: X -> S of a connected graph X into a closed orientable su...
Given a graph G(V, E), finding two vertex-disjoint cycles in it is a difficult problem. This paper s...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
"A graph ＄G＄ is said to be uniquely embeddable in a surface ＄F^{2}＄ if for any two embeddings ＄f_{1}...
AbstractWe show that every 3-connected planar graph has a circular embedding in some nonspherical su...
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of ...
Abstract We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles...
AbstractGraphs that have two disjoint noncontractible cycles in every possible embedding in surfaces...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
AbstractIn a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bou...
AbstractWe prove that for any orientable surface S and any non-negative integer k, there exists an i...
AbstractIt is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere h...
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a suf...
It has been proved that in the orientable surface of genus g(g ≥ 2), the number of pairwise disjoint...
AbstractA polyhedral map on a surface is a 2-cell embedding of a connected graph on the surface such...
Two 2-cell embeddings A +/-: X -> S and j: X -> S of a connected graph X into a closed orientable su...
Given a graph G(V, E), finding two vertex-disjoint cycles in it is a difficult problem. This paper s...
AbstractA closed 2-cell embedding of a graph embedded in some surface is an embedding such that each...
"A graph ＄G＄ is said to be uniquely embeddable in a surface ＄F^{2}＄ if for any two embeddings ＄f_{1}...
AbstractWe show that every 3-connected planar graph has a circular embedding in some nonspherical su...
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of ...
Abstract We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles...