An undirected, unweighted, simple graph is said to be 2-colorable if there exists a function such that for every , .
Which of the following statements about 2-colorable graphs is/are true?
- AIf is 2-colorable, then may contain cycles of odd length
- BIf is 2-colorable, then may contain cycles of even length
- CAn optimal algorithm for testing whether is 2-colorable runs in time , if is represented as an adjacency list
- DAn optimal algorithm for testing whether is 2-colorable runs in time , if is represented as an adjacency list

