Login / Signup

An Improvement of the Bound on the Odd Chromatic Number of 1-Planar Graphs.

Bei NiuXin Zhang
Published in: AAIM (2022)
Keyphrases
  • computational complexity
  • planar graphs
  • lower bound
  • linear programming
  • pairwise
  • worst case
  • model selection