Question

Problem 2: Use gringo/clasp to determine whether the following graph can be colored with two colors so that no edge has both its endpoints colored with the same color, and if so, find at least one such coloring. Then, repeat the above assuming that three colors are available. More specifically, give propositional theories describing the two-coloring and the three-coloring problems for that graph, rewrite them into the gringo format, and run them through gringo/clasp 4
0 0
Add a comment Improve this question Transcribed image text
Answer #1

chromatic number(number of colors needed)=2

Possibility 1:

Ce e 1 o ei o4n el

Possibility 2:

eV C2. ea er-, color) olor 2

Number Of Colors needed=3

ca Ca 용-_-9 の2- Ci CR Tae even

Add a comment
Know the answer?
Add Answer to:
Problem 2: Use gringo/clasp to determine whether the following graph can be colored with two colors...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT