Skip to content

phabi.ch

yet another source of inspiration…

  • contact

Tag: graph coloring

Graph Coloring Problem

Posted on 10. September 202211. September 2022 by Fabian Leuthold

A node coloring is valid or admissible if any two adjacent nodes do not have the same color. If a graph is colorable, there is a smallest number such that the graph is node colorable. This number is called the chromatic number of the graph and is usually denoted by . The problem to identify… Read more Graph Coloring Problem

Skip to footer

what you can find here

posts on operations research, programming, tinkering, languages, health, society and more…

Categories

  • arduino
  • common
  • fun
  • heuristics & algorithms
  • micro:bit
  • optimization
  • programming
  • raspberry pi
  • tinkering
  • tools

Recent Posts

  • Solving Happy CubesĀ® on A micro:bit
  • Map Coloring Problem
  • Graph Coloring Problem
  • Neopixels with micro:bit
  • Solving a TSP with Linear Programming and Google OR-Tools in Python
Proudly powered by WordPress | Theme: Yocto by Humble Themes.