Scholars Central

OpinionPublished 2021

Chromatic Polynomials

Authors: Karrie Williams

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

When it comes to coloring the nodes of a graph under particular constraints, there are a lot of fascinating difficulties to explore which provide a quick overview of the basics of this section of graph theory. A graph's coloring is achieved by assigning one of a set of colours to each node in the graph. It's a translation of the nodes into (or onto) a set s C in more formal words (the set of colors). We'll put aside the debate over whether the mappings should be into either onto for the time being. A suitable colouring of a graph is one that fulfills the constraint that adjacent nodes are not assigned (i.e. mapped onto) the very same colour (element) of C. A colouring that does not meet these criteria is referred to as inappropriate colouring. These are the requirements; however, because we will almost always be dealing with proper colorings, it will be more practical to eliminate the word "proper" and agree that when we say "colorings" of a graph, we mean "proper colorings" unless otherwise stated

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Research & Reviews: Journal of Statistics and Mathematical Sciences.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalResearch & Reviews: Journal of Statistics and Mathematical Sciences
  • SubjectMathematics & Statistics
  • BylineArticles whose byline prints “Karrie Williams”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels