# zbMATH — the first resource for mathematics

Adjacent strong edge coloring of graphs. (English) Zbl 1008.05050
A proper edge coloring of a graph is an adjacent strong edge coloring if, for every adjacent vertices $$u$$ and $$v$$, the set of colors of all edges at $$u$$ is different from the set of all colors of edges at $$v$$. The authors determine the minimum number $$k$$ such that a tree (a cycle, a complete graph) has an adjacent strong edge coloring with $$k$$ colors. They then conjecture that every connected graph with at least six vertices has an adjacent strong edge coloring with at most maximum degree plus two colors. The paper is poorly written.

##### MSC:
 05C15 Coloring of graphs and hypergraphs
Full Text:
##### References:
 [1] Harary, F., Conditional colorability in graphs, () · Zbl 0556.05027 [2] Nelson, R.; Wilson, R.J., Graph colorings, (), 218 [3] Chartrand, G.; Lesniak-Foster, L., Graphs and digraphs ind. edition, (1986), Wadsworth Brooks/Cole Monterey, CA [4] Fiorini, S.; Wilson, R.J., Edge-coloring of graphs, () · Zbl 0421.05023
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.