AbstractThe toroidal thickness t1(G) of a graph G is the minimum value of k for which G is the edge-union of k graphs each embeddable on a torus. It is shown that t1(K4(n)) = [12(n + 1)]
AbstractThe genus γ(G) of a simple graph G is the minimum genus of the orientable surface on which G...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
AbstractIt is shown that the toroidal crossing number of the complete bipartite graph, Km, n, lies b...
AbstractThe toroidal thickness t1(G) of a graph G is the minimum value of k for which G is the edge-...
AbstractThe splitting number of a graph on a surface is defined, and a formula for the splitting num...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Two embeddings psi(1) and psi(2) of a graph G in a surface Sigma are equivalent if there is a homeom...
AbstractErdős et al. (Canad. J. Math. 18 (1966) 106–112) conjecture that there exists a constant dce...
This thesis consists of two parts. In the first part, we give a simple geometric description of the ...
The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly....
This script aim to determine the maximal value of m of K2,3,m graph so that can be redrawn on torus...
The theory of Dvořák et al. shows that a 4-critical triangle-free graph embedded in the torus has on...
AbstractThe genus γ(G) of a simple graph G is the minimum genus of the orientable surface on which G...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
AbstractIt is shown that the toroidal crossing number of the complete bipartite graph, Km, n, lies b...
AbstractThe toroidal thickness t1(G) of a graph G is the minimum value of k for which G is the edge-...
AbstractThe splitting number of a graph on a surface is defined, and a formula for the splitting num...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Two embeddings psi(1) and psi(2) of a graph G in a surface Sigma are equivalent if there is a homeom...
AbstractErdős et al. (Canad. J. Math. 18 (1966) 106–112) conjecture that there exists a constant dce...
This thesis consists of two parts. In the first part, we give a simple geometric description of the ...
The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly....
This script aim to determine the maximal value of m of K2,3,m graph so that can be redrawn on torus...
The theory of Dvořák et al. shows that a 4-critical triangle-free graph embedded in the torus has on...
AbstractThe genus γ(G) of a simple graph G is the minimum genus of the orientable surface on which G...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
AbstractIt is shown that the toroidal crossing number of the complete bipartite graph, Km, n, lies b...
DOI
Add to ORKG