Login / Signup

Improved bound for improper colourings of graphs with no odd clique minor.

Raphael Steiner
Published in: Comb. Probab. Comput. (2023)
Keyphrases
  • independent set
  • upper bound
  • graph properties
  • lower bound
  • graph matching
  • improved algorithm
  • graph model
  • maximum clique
  • graph theory
  • bayesian networks
  • worst case
  • directed graph
  • graph structure