AbstractThe smallest group with unknown genus isZ33. It is shown that it is embeddable into an orientable surface of genus 7 and into a nonorientable surface with the same Euler characteristics
International audienceWe investigate the complexity of finding an embedded non-orientable surface of...
International audienceWe investigate the complexity of finding an embedded non-orientable surface of...
AbstractWe identify three mutually nonisomorphic triangulations of the closed orientable surface of ...
AbstractThe smallest group with unknown genus isZ33. It is shown that it is embeddable into an orien...
AbstractUsing the genus embedding of the Cartesian product of three triangles we prove one can embed...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a tr...
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3...
Embeddings of Cayley graphs into nonorientable surfaces are studied. Some lower and upper bounds for...
We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a tr...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
Kn(m) is a regular n-partite graph with nm vertices. We prove that K12s+7(3α) and K12s+7(3α·2) can b...
AbstractFor n = 12s + 9 (s ≥ 4) we imbed Kn − K6 in an orientable surface of genus 12s2 + 11s
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
AbstractThis paper is concerned with nonisomorphic triangular embeddings of a complete graph into th...
International audienceWe investigate the complexity of finding an embedded non-orientable surface of...
International audienceWe investigate the complexity of finding an embedded non-orientable surface of...
AbstractWe identify three mutually nonisomorphic triangulations of the closed orientable surface of ...
AbstractThe smallest group with unknown genus isZ33. It is shown that it is embeddable into an orien...
AbstractUsing the genus embedding of the Cartesian product of three triangles we prove one can embed...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a tr...
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3...
Embeddings of Cayley graphs into nonorientable surfaces are studied. Some lower and upper bounds for...
We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a tr...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
Kn(m) is a regular n-partite graph with nm vertices. We prove that K12s+7(3α) and K12s+7(3α·2) can b...
AbstractFor n = 12s + 9 (s ≥ 4) we imbed Kn − K6 in an orientable surface of genus 12s2 + 11s
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
AbstractThis paper is concerned with nonisomorphic triangular embeddings of a complete graph into th...
International audienceWe investigate the complexity of finding an embedded non-orientable surface of...
International audienceWe investigate the complexity of finding an embedded non-orientable surface of...
AbstractWe identify three mutually nonisomorphic triangulations of the closed orientable surface of ...
DOI
Add to ORKG