Computing Chromatic Polynomials for Special Families of Graphs (Classic Reprint) - Softcover

Inhaltsangabe

Excerpt from Computing Chromatic Polynomials for Special Families of Graphs

Given a graph G, we can label its vertices Now we introduce a set of 1 colors, and assign a color to each of the n vertices so that two vertices joined by an edge do not receive the same color. Such an assignment is a proper coloring of G; by a coloring of G, we shall mean a proper coloring. Note that not all of the 1 colors need be used.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.