Add to ORKGAbstract. It is shown that for 78 of the 80 isomorphism classes of Steiner triple systems of order 15 it is possible to find a face 2-colourable triangulation of the complete graph K15 in an orientable surface in which the colour classes both form representatives of the specified isomorphism class. For one of the two remaining isomorphism classes it is proved that this is not possible. We also discuss the remaining open case. 1
We construct face two-colourable triangulations of the graph 2Kn in an orientable surface; equivalen...
AbstractLet S be a Steiner triple system and G a cubic graph. We say that G is S-colourable if its e...
We prove that for n>3 every STS(n) has both an orientable and a nonorientable embedding in which the...
It is shown that for 78 of the 80 isomorphism classes of Steiner triple systems of order 15 it is po...
It is shown that each possible pair of the 80 isomorphism classes of Steiner triple systems of order...
It was shown by Gerhard Ringel that one of the three non-isomorphic Steiner triple systems of order ...
A complete enumeration is given of orientable biembeddings involving five of the 80 Steiner triple s...
A cyclic face 2-colourable triangulation of the complete graph Kn in an orientable surface exists fo...
AbstractThere are 80 non-isomorphic Steiner triple systems of order 15. A standard listing of these ...
A complete enumeration is given of orientable biembeddings in-volving five of the 80 Steiner triple ...
There are 80 non-isomorphic Steiner triple systems of order 15. A standard listing of these is given...
Face two-colourable triangular embeddings of complete graphs $K_n$ correspond to biembeddings of Ste...
AbstractA face 2-colourable triangulation of an orientable surface by a complete graphKnexists if an...
AbstractConstructions due to Ringel show that there exists a nonorientable face 2-colourable triangu...
Constructions due to Ringel show that there exists a nonorientable face 2-colourable triangular embe...
We construct face two-colourable triangulations of the graph 2Kn in an orientable surface; equivalen...
AbstractLet S be a Steiner triple system and G a cubic graph. We say that G is S-colourable if its e...
We prove that for n>3 every STS(n) has both an orientable and a nonorientable embedding in which the...
It is shown that for 78 of the 80 isomorphism classes of Steiner triple systems of order 15 it is po...
It is shown that each possible pair of the 80 isomorphism classes of Steiner triple systems of order...
It was shown by Gerhard Ringel that one of the three non-isomorphic Steiner triple systems of order ...
A complete enumeration is given of orientable biembeddings involving five of the 80 Steiner triple s...
A cyclic face 2-colourable triangulation of the complete graph Kn in an orientable surface exists fo...
AbstractThere are 80 non-isomorphic Steiner triple systems of order 15. A standard listing of these ...
A complete enumeration is given of orientable biembeddings in-volving five of the 80 Steiner triple ...
There are 80 non-isomorphic Steiner triple systems of order 15. A standard listing of these is given...
Face two-colourable triangular embeddings of complete graphs $K_n$ correspond to biembeddings of Ste...
AbstractA face 2-colourable triangulation of an orientable surface by a complete graphKnexists if an...
AbstractConstructions due to Ringel show that there exists a nonorientable face 2-colourable triangu...
Constructions due to Ringel show that there exists a nonorientable face 2-colourable triangular embe...
We construct face two-colourable triangulations of the graph 2Kn in an orientable surface; equivalen...
AbstractLet S be a Steiner triple system and G a cubic graph. We say that G is S-colourable if its e...
We prove that for n>3 every STS(n) has both an orientable and a nonorientable embedding in which the...