OurBigBook About$ Donate
 Sign in Sign up

Neighbour-colour saving (Sv​=Rv​−Dv​)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Graph coloring Greedy coloring Extension of a partial colouring by neighbour-colour savings
2026-10-14  0 By others on same topic  0 Discussions Create my own version
The number of coloured neighbours of v minus the number of distinct colours on those neighbours. Repeated colours among pairwise nonadjacent neighbours reduce the number of unavailable colours without increasing the number of neighbours still to colour.

 Ancestors (8)

  1. Extension of a partial colouring by neighbour-colour savings
  2. Greedy coloring
  3. Graph coloring
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Colour savings from sparse neighbourhoods
  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 11 / 5 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook