19 - 4 5 Determining Chromatic Polynomial By a...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 A procedure for coloring small graphs: brute-force assign colors - get upper bound find a subgraph that needs at least that number of colors
Background image of page 2
3 Theorem. Let G be a planar graph. Then Proof. χ ( G ) 5 . Chromatic Polynomial: Important Note When Counting Colorings Using Chromatic Polynomials: We will assume vertices have unique labels, so two colorings will be considered different if they assign different colors at at least one vertex of the graph G . Chromatic Polynomials for Special Graphs:
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
Background image of page 13
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4 5 Determining Chromatic Polynomial By a Decomposition Method: 6 a and b have the same color in a coloring a and b have different colors in a coloring 7 8 9 Basic Properties of Chromatic Polynomials: 10 11 Fix such a coloring of this 12 13 Let G be a graph and let D be its orientation. Let l ( D ) be the length of a longest (directed) path in D . Then, ( G ) 1 + l ( D ) ....
View Full Document

Page1 / 13

19 - 4 5 Determining Chromatic Polynomial By a...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online