+1 vote
in Graph Theory by Active (340 points)

2 Answers

+2 votes
 
Best answer

The graph below does not have an articulation point or a hamiltonian cycle and uses 3 colors for graph coloring.

by AlgoMeister (584 points)
selected by
+3 votes
 A-----------B 
|       |
 |             /  |  \
 |           /    |    \
 |         E    |      F 
 |          \     |     /
 |            \   |   /
|       |
 D----------C 
In this graph:
  • It does not have an articulation point, as removing any single vertex does not disconnect the graph.
  • It has no Hamiltonian cycle, as no cycle visits each vertex exactly once.
  • It does not have a valid 2-coloring, it requires at least 3 colors( Red, Green, Blue) to avoid adjacent vertices having the same color- Represented in colored format in the graph.
by AlgoStar (400 points)
The Book: Analysis and Design of Algorithms | Presentations on Slideshare | Lecture Notes, etc
...