An acyclic edge coloring of a graph is a proper edge coloring without an...
An acyclic edge coloring of a graph is a proper edge coloring in which t...
Gallai's path decomposition conjecture states that if G is a connected
g...
Given a finite family ℱ of graphs, we say that a graph G is
"ℱ-free" if ...
A k-linear coloring of a graph G is an edge coloring of G with k
colors ...