CSE 2321 Lecture Notes - Lecture 32: Graph Coloring, Complete Bipartite Graph

4 views6 pages
Published on 30 Nov 2019
Course
Professor
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
Lecture 32
Hamiltonian path Apath in a
graph that visits each vertex
exactly once
M
y
xy
Hamiltonian Cylde AHamiltonian
path that starts and ends on
the same vertex
yA
u
Dirac's Theorem If each vertex of a
connected graph wuverticies is
adjacent to at least up verticies
then the graph has an HC
Unlock document

This preview shows pages 1-2 of the document.
Unlock all 6 pages and 3 million more documents.

Already have an account? Log in
apple
In Gng 2EdegCv fos VE
So Cy't has an HC
the condition of Dirac's term is
sufficient not necessary sufficient
Take the ceiling if 42 is odd
0O
OOnot an HC
fIIignies
V
Unlock document

This preview shows pages 1-2 of the document.
Unlock all 6 pages and 3 million more documents.

Already have an account? Log in

Get OneClass Notes+

Unlimited access to class notes and textbook notes.

YearlyBest Value
75% OFF
$8 USD/m
Monthly
$30 USD/m
You will be charged $96 USD upfront and auto renewed at the end of each cycle. You may cancel anytime under Payment Settings. For more information, see our Terms and Privacy.
Payments are encrypted using 256-bit SSL. Powered by Stripe.