Discrete Math Quiz
11 questions · no time limit
0:00
GRAPH THEORY
Question 1 of 11
No time limit
Current
Answered
Flagged
Not seen
In a simple connected planar graph, if every face is bounded by at least k edges and every edge bounds exactly 2 faces, which inequality must hold between the number of edges e and faces f?
YOUR PROGRESS
11
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end