Add to ORKGLet G be a 2-edge-colored complete graph of even order n. A cycle of G is alternating if any two successive edges differ in color. We prove that there is a one-to-one correspondence between the set of bipartite tournaments of order n admitting a unique hamiltonian cycle and the set of 2-edge-colored complete graphs of order n admitting a unique alternating hamiltonian cycle. © 2002 Elsevier Science B.V. All rights reserve
Let Kcn denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(...
Zaslavsky observed that the topics of directed cycles in directed graphs and alternating cycles in e...
It is conjectured that every edge-colored complete graph (Formula presented.) on (Formula presented....
AbstractLet G be a 2-edge-colored complete graph of even order n. A cycle of G is alternating if any...
It is shown that for every ffl ? 0 and n ? n 0 (ffl), any complete graph K on n vertices whose edges...
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its successive edges ...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
AbstractWe consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its su...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
Colour the edges of a complete graph with n vertices in such a way that no vertex is on more than k ...
AbstractWe show that if G = Kn,n is edge-coloured with r⩾2 colours so that the subgraph induced by t...
Given a complete graph with an even number of vertices, and with each edge colored with one of two c...
Let Kcn denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(...
Zaslavsky observed that the topics of directed cycles in directed graphs and alternating cycles in e...
It is conjectured that every edge-colored complete graph (Formula presented.) on (Formula presented....
AbstractLet G be a 2-edge-colored complete graph of even order n. A cycle of G is alternating if any...
It is shown that for every ffl ? 0 and n ? n 0 (ffl), any complete graph K on n vertices whose edges...
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its successive edges ...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
AbstractWe consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its su...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
Colour the edges of a complete graph with n vertices in such a way that no vertex is on more than k ...
AbstractWe show that if G = Kn,n is edge-coloured with r⩾2 colours so that the subgraph induced by t...
Given a complete graph with an even number of vertices, and with each edge colored with one of two c...
Let Kcn denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(...
Zaslavsky observed that the topics of directed cycles in directed graphs and alternating cycles in e...
It is conjectured that every edge-colored complete graph (Formula presented.) on (Formula presented....