DOIAbstract
AbstractWe give necessary and sufficient conditions for a given graph embedded on the torus, to contain edge-disjoint cycles of prescribed homotopies (under the assumption of a “parity” condition)
AbstractWe give necessary and sufficient conditions for a given graph embedded on the torus, to contain edge-disjoint cycles of prescribed homotopies (under the assumption of a “parity” condition)
The torus is one of the popular topologies for the interconnecting processors to build high-performa...
AbstractGiven any l(≥ 2) disjoint edges in a (2l − 2)-connected graph, there is a circuit containing...
It is conjectured that every edge-colored complete graph (Formula presented.) on (Formula presented....
We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein ...
AbstractWe give necessary and sufficient conditions for a directed graph embedded on the torus or th...
AbstractWe give necessary and sufficient conditions for a directed graph embedded on the torus or th...
AbstractGiven any l(≥ 2) disjoint edges in a (2l − 2)-connected graph, there is a circuit containing...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
Abstract We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles...
We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamilton...
AbstractAlthough questions about Eulerian circuits, paths, and covering edges by edge disjoint paths...
AbstractIf L is a set of at most l disjoint edges in a [32l−12]-connected graph, then there is a cir...
AbstractWe show that if G is a graph embedded on the torus S and eaeh nonnullhomotopic closed curve ...
The torus is one of the popular topologies for the interconnecting processors to build high-performa...
The torus is one of the popular topologies for the interconnecting processors to build high-performa...
AbstractGiven any l(≥ 2) disjoint edges in a (2l − 2)-connected graph, there is a circuit containing...
It is conjectured that every edge-colored complete graph (Formula presented.) on (Formula presented....
We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein ...
AbstractWe give necessary and sufficient conditions for a directed graph embedded on the torus or th...
AbstractWe give necessary and sufficient conditions for a directed graph embedded on the torus or th...
AbstractGiven any l(≥ 2) disjoint edges in a (2l − 2)-connected graph, there is a circuit containing...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especia...
Abstract We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles...
We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamilton...
AbstractAlthough questions about Eulerian circuits, paths, and covering edges by edge disjoint paths...
AbstractIf L is a set of at most l disjoint edges in a [32l−12]-connected graph, then there is a cir...
AbstractWe show that if G is a graph embedded on the torus S and eaeh nonnullhomotopic closed curve ...
The torus is one of the popular topologies for the interconnecting processors to build high-performa...
The torus is one of the popular topologies for the interconnecting processors to build high-performa...
AbstractGiven any l(≥ 2) disjoint edges in a (2l − 2)-connected graph, there is a circuit containing...
It is conjectured that every edge-colored complete graph (Formula presented.) on (Formula presented....
Add to ORKG