Get all the updates for this publication
Articles
Some graph classes satisfying acyclic edge colouring conjecturePublished in
2010
We present some classes of graphs which satisfy the acyclic edge colouring conjecture which states that any graph can be acyclically edge coloured with at most ∆ + 2 colours
Content may be subject to copyright.
About the journal
| Journal | Submitted |
|---|
Authors (1)
