DOIAbstract
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especially we focus on methods relating graphs embedded on the torus to integer polygons in the Euclidean plane
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especially we focus on methods relating graphs embedded on the torus to integer polygons in the Euclidean plane
We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein ...
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal gri...
AbstractA graph of a triangulation of the torus is said to be uniquely embeddable in the torus provi...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
AbstractWe show that if G is a graph embedded on the torus S and eaeh nonnullhomotopic closed curve ...
AbstractWe give necessary and sufficient conditions for a given graph embedded on the torus, to cont...
Embedding graphs on the torus is a problem with both theoretical and practical significance. It is r...
Let G be a graph embedded on a surface S. Each cycle in G is an element of a homotopy class of simpl...
International audienceIn this paper, we describe the circuit polytope on series–parallel graphs. We ...
AbstractWe prove that every edge in a 5-connected graph embedded in the torus is contained in a Hami...
International audienceIn this paper, we describe the circuit polytope on series–parallel graphs. We ...
AbstractGiven the graph of a 3-dimensional convex polytope, a circuit can be found through any speci...
AbstractErdős et al. (Canad. J. Math. 18 (1966) 106–112) conjecture that there exists a constant dce...
AbstractAn algorithm is presented for determining whether a cubic graph (i.e., every vertex of which...
We prove that every edge in a 5-connected graph embedded in the torus is contained in a Hamilton cyc...
We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein ...
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal gri...
AbstractA graph of a triangulation of the torus is said to be uniquely embeddable in the torus provi...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
AbstractWe show that if G is a graph embedded on the torus S and eaeh nonnullhomotopic closed curve ...
AbstractWe give necessary and sufficient conditions for a given graph embedded on the torus, to cont...
Embedding graphs on the torus is a problem with both theoretical and practical significance. It is r...
Let G be a graph embedded on a surface S. Each cycle in G is an element of a homotopy class of simpl...
International audienceIn this paper, we describe the circuit polytope on series–parallel graphs. We ...
AbstractWe prove that every edge in a 5-connected graph embedded in the torus is contained in a Hami...
International audienceIn this paper, we describe the circuit polytope on series–parallel graphs. We ...
AbstractGiven the graph of a 3-dimensional convex polytope, a circuit can be found through any speci...
AbstractErdős et al. (Canad. J. Math. 18 (1966) 106–112) conjecture that there exists a constant dce...
AbstractAn algorithm is presented for determining whether a cubic graph (i.e., every vertex of which...
We prove that every edge in a 5-connected graph embedded in the torus is contained in a Hamilton cyc...
We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein ...
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal gri...
AbstractA graph of a triangulation of the torus is said to be uniquely embeddable in the torus provi...
Add to ORKG