Login / Signup

(Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles.

Gerard J. ChangNicolas Roussel
Published in: Discret. Math. (2012)
Keyphrases
  • minimum weight
  • planar graphs
  • weighted graph
  • social networks