The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle”

Paths through fixed vertices in edge-colored graphs

W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza (1994)

Mathématiques et Sciences Humaines

Similarity:

We study the problem of finding an alternating path having given endpoints and passing through a given set of vertices in edge-colored graphs (a path is alternating if any two consecutive edges are in different colors). In particular, we show that this problem in NP-complete for 2-edge-colored graphs. Then we give a polynomial characterization when we restrict ourselves to 2-edge-colored complete graphs. We also investigate on (s,t)-paths through fixed vertices, i.e. paths of length...

Fruit salad.

Gyárfás, András (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Rainbow H -factors.

Yuster, Raphael (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six

Yuehua Bu, Ko-Wei Lih, Weifan Wang (2011)

Discussiones Mathematicae Graph Theory

Similarity:

An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring o G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ'ₐ(G). We prove that χ'ₐ(G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges whose girth is at least 6. This gives new evidence to a conjecture proposed in [Z. Zhang, L. Liu,...