Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Exercises in Graph Theory[removed], T.W.Leung) In a party of n persons, , at least one person does not shake hand with everybody, determine the maximum number of persons in the party that shake hand with everybody.
Add to Reading List
Document Date: 2004-01-04 14:01:42
Open Document
File Size: 32,00 KB
Share Result on Facebook
Position
leader /
leader of a team /
/
SocialTag
Line graph
Graph theory
Graph
Edge coloring
Exercises in Graph Theory[removed], T.W.Leung) In a party of n persons, , at least one person does not shake hand with everybody, determine the maximum number of persons in the party that shake hand with everybody.