Three-Colorability of an Undirected Graph

snowflake

Problem: Three-Colorability of an Undirected Graph

Given an undirected graph, determine whether every vertex can be assigned one of three colors such that the two endpoints of every edge have diff...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: