AbstractLet G be an edge-colored graph. An alternating cycle of G is a cycle of G in which any two consecutive edges have distinct colors. Let dc(v), the color degree of a vertex v, be defined as the maximum number of edges incident with v that have distinct colors. In this paper, we study color degree conditions for the existence of alternating cycles of prescribed length
For an edge-colored graph, its minimum color degree is the minimum number of distinct colors appeari...
In an edge-colored graph, let dc(v) be the number of colors on the edges incident to v and let δc(G)...
AbstractIn an edge-colored graph, we say that a path is alternating if it has at least three vertice...
AbstractLet G be an edge-colored graph. An alternating cycle of G is a cycle of G in which any two c...
AbstractGiven a graph G and an edge-coloring C of G, a heterochromatic cycle of G is a cycle in whic...
For an edge-colored graph, its minimum color degree is defined as the minimum number of colors appea...
An edge-colored graph is a graph with each edge assigned a color. A properly colored cycle ( or PC c...
AbstractA path or cycle in an edge-coloured multigraph is called alternating if its successive edges...
It is shown that for every ffl ? 0 and n ? n 0 (ffl), any complete graph K on n vertices whose edges...
Grossman and Haggkvist gave a characterisation of two-edge-coloured graphs, which have an alternatin...
AbstractWe prove that if the edges of the complete graph on n≥6 vertices are colored so that no vert...
Let G be an edge-colored graph. The minimum color degree of G is the minimum number of different col...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
A proper edge-coloring of a graph G with colors 1, , t is called an interval cyclic t coloring if...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
For an edge-colored graph, its minimum color degree is the minimum number of distinct colors appeari...
In an edge-colored graph, let dc(v) be the number of colors on the edges incident to v and let δc(G)...
AbstractIn an edge-colored graph, we say that a path is alternating if it has at least three vertice...
AbstractLet G be an edge-colored graph. An alternating cycle of G is a cycle of G in which any two c...
AbstractGiven a graph G and an edge-coloring C of G, a heterochromatic cycle of G is a cycle in whic...
For an edge-colored graph, its minimum color degree is defined as the minimum number of colors appea...
An edge-colored graph is a graph with each edge assigned a color. A properly colored cycle ( or PC c...
AbstractA path or cycle in an edge-coloured multigraph is called alternating if its successive edges...
It is shown that for every ffl ? 0 and n ? n 0 (ffl), any complete graph K on n vertices whose edges...
Grossman and Haggkvist gave a characterisation of two-edge-coloured graphs, which have an alternatin...
AbstractWe prove that if the edges of the complete graph on n≥6 vertices are colored so that no vert...
Let G be an edge-colored graph. The minimum color degree of G is the minimum number of different col...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
A proper edge-coloring of a graph G with colors 1, , t is called an interval cyclic t coloring if...
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive...
For an edge-colored graph, its minimum color degree is the minimum number of distinct colors appeari...
In an edge-colored graph, let dc(v) be the number of colors on the edges incident to v and let δc(G)...
AbstractIn an edge-colored graph, we say that a path is alternating if it has at least three vertice...
DOI
Add to ORKG