In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on the at torus. For any size collection of geodesics, the number of unique intersections is countable via their slopes. As well, any embedding of two geodesics gives rise to a circulant graph for which its chromatic number can be calculated from their respective slopes. Furthermore, the previously described circulant graphs embedded on the at torus are self-dual. This provides an effective face coloring of any graph arising from the embedding of two slopes on the torus
AbstractWe present a procedure to compute all the circles in the intersection curve of two tori, bas...
ABSTRACT. We show that for a surface Σ, the subgraph of the pants graph determined by fixing a colle...
Workshop is part of the Computational Geometry weekInternational audienceThe problem of efficiently ...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
We study properties of geodesic foliations on the flat, n-dimensional torus. Using the isomorphism ...
Circulant graphs are characterized here as quotient lattices, which are realized as vertices connect...
AbstractCirculant graphs are characterized here as quotient lattices, which are realized as vertices...
A geodesic from a to b in a directed graph is the shortest directed path from a to b. R. C. Entringe...
A graph is geodetic if each two vertices are joined by a unique shortest path. The problem of charac...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
AbstractA graph of a triangulation of the torus is said to be uniquely embeddable in the torus provi...
The Publisher regrets that this article is an accidental duplication of an article that has already ...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
AbstractWe present a procedure to compute all the circles in the intersection curve of two tori, bas...
ABSTRACT. We show that for a surface Σ, the subgraph of the pants graph determined by fixing a colle...
Workshop is part of the Computational Geometry weekInternational audienceThe problem of efficiently ...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
We study properties of geodesic foliations on the flat, n-dimensional torus. Using the isomorphism ...
Circulant graphs are characterized here as quotient lattices, which are realized as vertices connect...
AbstractCirculant graphs are characterized here as quotient lattices, which are realized as vertices...
A geodesic from a to b in a directed graph is the shortest directed path from a to b. R. C. Entringe...
A graph is geodetic if each two vertices are joined by a unique shortest path. The problem of charac...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
AbstractA graph of a triangulation of the torus is said to be uniquely embeddable in the torus provi...
The Publisher regrets that this article is an accidental duplication of an article that has already ...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
In this thesis, we obtain combinatorial algorithms that determine the minimal number of self-interse...
AbstractWe present a procedure to compute all the circles in the intersection curve of two tori, bas...
ABSTRACT. We show that for a surface Σ, the subgraph of the pants graph determined by fixing a colle...
Workshop is part of the Computational Geometry weekInternational audienceThe problem of efficiently ...