AbstractLet G be a complete graph Kp (or a complete bipartite graph Km,m) with its lines colored so that no point is on more than k lines of the same color. If p ≥ 17k (or m ≥ 25k) then G has a cycle of every possible size with adjacent lines different colors
For a connected graph G and a positive integer k, the kth power Gkof G is the graph with V (Gk) = V ...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
AbstractA hamiltonian coloring of a connected graph G of order n is an assignment c of colors (posit...
Colour the edges of a complete graph with n vertices in such a way that no vertex is on more than k ...
It is shown that for every ffl ? 0 and n ? n 0 (ffl), any complete graph K on n vertices whose edges...
AbstractLet G be a complete graph Kp (or a complete bipartite graph Km,m) with its lines colored so ...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
AbstractIf the lines of the complete graph Kn are colored so that no point is on more than 17(n−1) l...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
Abstract: "The edges of the complete graph K[subscript n] are coloured so that no colour appears no ...
AbstractThe edges of the complete graph Kn are coloured so that no colour appears more than k=k(n) t...
Let Kcn denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(...
For a connected graph G and a positive integer k, the kth power Gkof G is the graph with V (Gk) = V ...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
AbstractA hamiltonian coloring of a connected graph G of order n is an assignment c of colors (posit...
Colour the edges of a complete graph with n vertices in such a way that no vertex is on more than k ...
It is shown that for every ffl ? 0 and n ? n 0 (ffl), any complete graph K on n vertices whose edges...
AbstractLet G be a complete graph Kp (or a complete bipartite graph Km,m) with its lines colored so ...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
AbstractIf the lines of the complete graph Kn are colored so that no point is on more than 17(n−1) l...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so t...
Abstract: "The edges of the complete graph K[subscript n] are coloured so that no colour appears no ...
AbstractThe edges of the complete graph Kn are coloured so that no colour appears more than k=k(n) t...
Let Kcn denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(...
For a connected graph G and a positive integer k, the kth power Gkof G is the graph with V (Gk) = V ...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
AbstractA hamiltonian coloring of a connected graph G of order n is an assignment c of colors (posit...
DOI
Add to ORKG