Purchase Solution

Graph coloring; chromatic number of graph

Not what you're looking for?

Ask Custom Question

The three questions are stated in an attached .doc file (1.doc).

In part 1, a diagram is given, and whether the object depicted in the diagram is a graph is to be determined.

In part 2, a graph is given and its chromatic number is to be determined.

In part 3, a graph is given and the number of colors needed to color the regions of the graph (to ensure that adjacent regions have different colors) is to be determined.

Attachments
Purchase this Solution
Solution Summary

The question of whether the object depicted in the given diagram in part 1 is a graph is answered. A detailed determination of the chromatic number of the graph in part 2 is presented, as is a detailed determination of the number of colors needed in part 3 (to ensure that adjacent regions have different colors). The definition of chromatic number of a graph is reviewed.

Solution Preview

Complete solutions are given in an attached .doc file (1-Solution.doc).

In part 1, it is determined that the objected depicted in the given diagram is a graph; its vertex set and edge set are presented.

In part 2, the definition of chromatic ...

Solution provided by:
Georgia Martin, PhD
Education
  • AB, Hood College
  • PhD, The Catholic University of America
  • PhD, The University of Maryland at College Park
Recent Feedback
  • "Thanks for your assistance. "
  • "Thank you. I understand now."
  • "Super - Thank You"
  • "Very clear. I appreciate your help. Thank you."
  • "Great. thank you so much!"
Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Probability Quiz

Some questions on probability

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

View More Free Quizzes
Related BrainMass Solutions

  • Chromatic Numbers and Graph Coloring

    (The minimum integer for which a graph is -colorable is called the vertex chromatic number, or simply the chromatic number of , and is denote by , this problem is about graph coloring).

  • chromatic number of graph and adjacency matrix

    Answer: 1 The chromatic number of a graph is the least number of colors required to do coloring of that graph or more clearly we can say that the chromatic number of a graph G is the smallest number of colors needed to color

  • List-Chromatic Numbers

    104045 List-Chromatic Numbers Show that K3,3 has list-chromatic number 3. Please can you explain what does list-chromatic number means and don't forget to draw a graph.

  • Graphs : Coloring Maps

    Proof : Let G we any graph of 2 face colourable. Then dual graph of G., i.e. G* having chromatic number (G)= 2. Therefore G* is a bipartite graph. Note that every graph is bipartite if and only if it has chromatic number 2.

  • Vertex Chromatic Numbers and Betti Numbers

    X(G) is the minimum integer k for which a graph G is k-colorable is called the vertex chromatic number In the page 82 B(G) is defined like independent sets like you say but in the page 187 it other kind of B and it is define like Betti number and

  • Chromatic numbers

    What is the chromatic number of G? Is G planar? See the attached file. See attachment. This solution shows how to find the chromatic number.

  • Determine the class of Kr,r.

    By Vizing's Theorem for the edge chromatic number , we know that ......................(1) where is the maximum degree of a simple graph G. Since is an integer, (1) implies that or .

  • Graphs : Chromatic Number

    Thus, for example, X(C_(2k))=2 and X(C_(2k+1))=3 Chromatic number: The chromatic number of a graph is the minimum number of colours required to colour it.

  • Graphs : Coloring Maps

    157586 Graphs : Coloring Maps Let G be a cubic plane graph. Prove that the map M(G) is 3-colourable iff each country has an even number of sides.

View More Related Solutions