AbstractIn this paper the following formula for the genus of the symmetric quadripartite graph is proved. γ(Kn,n,n,n) = (n−1)2 for all n≠3
AbstractUsing the genus embedding of the Cartesian product of three triangles we prove one can embed...
The genus of a group is the minimum genus for any Cayley color graph of the group. Using the structu...
The set of orientable imbeddings of a graph can be partitioned according to the genus of the imbeddi...
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3...
AbstractIn this paper the following formula for the genus of the symmetric quadripartite graph is pr...
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3...
AbstractTwo-cell embeddings of graphs in orientable surfaces have been studied extensively by combin...
AbstractThe genus of the complete tripartite graph Kmn,n,n is shown to be (mn−2)(n−1)/2, for all nat...
The problem of determining the genus for a graph can be dated to the Map Color Conjecture proposed b...
AbstractThe Heawood map coloring conjecture for orientable 2-manifolds is one of the oldest unsolved...
AbstractBy imposing a special symmetry, we are able to construct index four triangular embeddings of...
AbstractFor n = 12s + 9 (s ≥ 4) we imbed Kn − K6 in an orientable surface of genus 12s2 + 11s
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
The genus of a group is the minimum genus for any Cayley color graph of the group. Using the structu...
AbstractUsing the genus embedding of the Cartesian product of three triangles we prove one can embed...
The genus of a group is the minimum genus for any Cayley color graph of the group. Using the structu...
The set of orientable imbeddings of a graph can be partitioned according to the genus of the imbeddi...
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3...
AbstractIn this paper the following formula for the genus of the symmetric quadripartite graph is pr...
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3...
AbstractTwo-cell embeddings of graphs in orientable surfaces have been studied extensively by combin...
AbstractThe genus of the complete tripartite graph Kmn,n,n is shown to be (mn−2)(n−1)/2, for all nat...
The problem of determining the genus for a graph can be dated to the Map Color Conjecture proposed b...
AbstractThe Heawood map coloring conjecture for orientable 2-manifolds is one of the oldest unsolved...
AbstractBy imposing a special symmetry, we are able to construct index four triangular embeddings of...
AbstractFor n = 12s + 9 (s ≥ 4) we imbed Kn − K6 in an orientable surface of genus 12s2 + 11s
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
The genus of a group is the minimum genus for any Cayley color graph of the group. Using the structu...
AbstractUsing the genus embedding of the Cartesian product of three triangles we prove one can embed...
The genus of a group is the minimum genus for any Cayley color graph of the group. Using the structu...
The set of orientable imbeddings of a graph can be partitioned according to the genus of the imbeddi...
DOI
Add to ORKG