Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

On Twin Edge Colorings of Graphs

100%

Andrews E., Helenius L., Johnston D., VerWys J., Zhang P.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 3

613-627

A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring. The minimum k for which G has a twin edge k-coloring is called the twin chromatic index of G. Among the results presented are formulas for the twin chromatic index of each complete graph and each complete bipartite graph

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Andrews E.

1 Helenius L.

1 Johnston D.

1 VerWys J.

1 Zhang P.

1 2014

Wyniki wyszukiwania

On Twin Edge Colorings of Graphs