Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
21 views1 page

Graph Coloring HW 21 Fixed - SHPS

The document discusses properties of graphs, specifically focusing on the types of graphs based on their characteristics. It establishes that if n is even, then Kn is classified as type 2. Additionally, it mentions conditions for total coloring of graphs and the implications of adjacency in this context.

Uploaded by

shahriyarpourakbarsaffar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views1 page

Graph Coloring HW 21 Fixed - SHPS

The document discusses properties of graphs, specifically focusing on the types of graphs based on their characteristics. It establishes that if n is even, then Kn is classified as type 2. Additionally, it mentions conditions for total coloring of graphs and the implications of adjacency in this context.

Uploaded by

shahriyarpourakbarsaffar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Hw21: nis even, Kn is type 2.

Lee G = Kn, Cand 4 be X( o)-caye celeri ny of G.


be a X(Gtotel ccloring of Gst
(G'yh.Let t
Dppese ve V(C) and ler

-’te ca, e (e)


/
Badjacent, Ahen (e) (e)+(e') -4 (e')
e nd e' wre (u:tQuy)
+Rw.(u')
} w ndoare ndjacant,then t? ?(e) /
w):RQw,)+ t w i )
then
etu,z are mcident,
and
Hence, ku is Xhototal celorable
(Kn)tt=A(K)+2 typel or type '2.
(Kan)=
Kna is class 2 s X(Kws X
n is eve

Snce n is not type | whe n is even, it must be type 2.

You might also like