AbstractWe show that if G = Kn,n is edge-coloured with r⩾2 colours so that the subgraph induced by the edges of each colour is regular of order 2n, then G has a Hamiltonian circuit in which asjacent edges have different colours. We also give a generalization of this result to the case when G is a regular bipartite graph
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its successive edges ...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractWe consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its su...
Colour the edges of a complete graph with n vertices in such a way that no vertex is on more than k ...
AbstractThe edges of the complete graph Kn are coloured so that no colour appears more than k=k(n) t...
Abstract: "The edges of the complete graph K[subscript n] are coloured so that no colour appears no ...
Let G be a 2-edge-colored complete graph of even order n. A cycle of G is alternating if any two suc...
It is shown that for every ffl ? 0 and n ? n 0 (ffl), any complete graph K on n vertices whose edges...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
The author has investigated the properties of Hamiltonian circuits in a class of trivalent planar gr...
AbstractLet G be a 2-edge-colored complete graph of even order n. A cycle of G is alternating if any...
AbstractWe prove a theorem showing that for every integer p (p⩾2) there is a good minimal coloring o...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
AbstractLet G be a complete graph Kp (or a complete bipartite graph Km,m) with its lines colored so ...
AbstractA path or cycle in an edge-coloured multigraph is called alternating if its successive edges...
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its successive edges ...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractWe consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its su...
Colour the edges of a complete graph with n vertices in such a way that no vertex is on more than k ...
AbstractThe edges of the complete graph Kn are coloured so that no colour appears more than k=k(n) t...
Abstract: "The edges of the complete graph K[subscript n] are coloured so that no colour appears no ...
Let G be a 2-edge-colored complete graph of even order n. A cycle of G is alternating if any two suc...
It is shown that for every ffl ? 0 and n ? n 0 (ffl), any complete graph K on n vertices whose edges...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
The author has investigated the properties of Hamiltonian circuits in a class of trivalent planar gr...
AbstractLet G be a 2-edge-colored complete graph of even order n. A cycle of G is alternating if any...
AbstractWe prove a theorem showing that for every integer p (p⩾2) there is a good minimal coloring o...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
AbstractLet G be a complete graph Kp (or a complete bipartite graph Km,m) with its lines colored so ...
AbstractA path or cycle in an edge-coloured multigraph is called alternating if its successive edges...
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its successive edges ...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractWe consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its su...
DOI
Add to ORKG