Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Odd Cycle - Graph Theory - Lecture Slides, Slides of Design Patterns

The key points discuss in the Graph theory, which I found very informative are: Odd Cycle, Connected Graph, Neither Complete, Every Integer, Graph, Chromatic Number, Girth, Constructible, Non-Adjacent, K-Constructible Subgraph

Typology: Slides

2012/2013

Uploaded on 04/20/2013

sathyai
sathyai 🇮🇳

5

(5)

73 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Graph Theory: Lecture No. 14
(Brooks 1941) Let Gbe a connected graph. If
Gis neither complete nor and odd cycle, then
χ(G)∆(G).
Docsity.com
pf3
pf4

Partial preview of the text

Download Odd Cycle - Graph Theory - Lecture Slides and more Slides Design Patterns in PDF only on Docsity!

(Brooks 1941) Let G be a connected graph. If G is neither complete nor and odd cycle, then χ(G ) ≤ ∆(G ).

For every integer k, there exists a graph G with girth g (G ) > k and chromatic number χ(G ) > k.

Let G be a graph and k ∈ N. Then χ(G ) ≥ k if and only if G has a k-constructible subgraph.