Login / Signup

Precise upper bound for the strong edge chromatic number of sparse planar graphs.

Oleg V. BorodinAnna O. Ivanova
Published in: Discuss. Math. Graph Theory (2013)
Keyphrases
  • upper bound
  • lower bound
  • computational complexity
  • special case
  • undirected graph
  • planar graphs