Waste less time on Facebook — follow Brilliant.
Excel in math and science
Master concepts by solving fun, challenging problems.
It's hard to learn from lectures and videos
Learn more effectively through short, conceptual quizzes.
Our wiki is made for math and science
Master advanced concepts through explanations,
examples, and problems from the community.
Used and loved by 4 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Back to all chapters
Graph Theory
Any connected group of things can be represented as a graph: cities and roads, people and friendships, and more. Learn why an even number of people have an odd number of friends.
Excel in math and science
Master concepts by solving fun, challenging problems.
It's hard to learn from lectures and videos
Learn more effectively through short, conceptual quizzes.
Our wiki is made for math and science
Master advanced concepts through explanations,
examples, and problems from the community.
Used and loved by 4 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
Concept Quizzes
What must be true of a path that is an Eulerian path?
Excel in math and science
Master concepts by solving fun, challenging problems.
It's hard to learn from lectures and videos
Learn more effectively through short, conceptual quizzes.
Our wiki is made for math and science
Master advanced concepts through explanations,
examples, and problems from the community.
Used and loved by 4 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
by Brilliant Staff
True or false, if a graph has an Eulerian path then it has an Eulerian circuit.
Excel in math and science
Master concepts by solving fun, challenging problems.
It's hard to learn from lectures and videos
Learn more effectively through short, conceptual quizzes.
Our wiki is made for math and science
Master advanced concepts through explanations,
examples, and problems from the community.
Used and loved by 4 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
by Brilliant Staff
True or false, if \(G \) is a connected graph with at least two nodes, then an Eulerian path in \( G \) must visit every node.
Excel in math and science
Master concepts by solving fun, challenging problems.
It's hard to learn from lectures and videos
Learn more effectively through short, conceptual quizzes.
Our wiki is made for math and science
Master advanced concepts through explanations,
examples, and problems from the community.
Used and loved by 4 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
by Brilliant Staff
Two graphs \( G \) and \( G' \) each have at least one Eulerian circuit. Let \( G'' \) be a graph derived by combining both \( G \) and \( G' \) with a single edge between some node in \( G \) to some node in \( G' \). Does \( G'' \) have an Eulerian circuit?
Excel in math and science
Master concepts by solving fun, challenging problems.
It's hard to learn from lectures and videos
Learn more effectively through short, conceptual quizzes.
Our wiki is made for math and science
Master advanced concepts through explanations,
examples, and problems from the community.
Used and loved by 4 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
by Brilliant Staff
Suppose a connected graph has 15 nodes. Given that is has an Eulerian circuit, what is the minimum number of distinct Eulerian circuits which it must have?
NOTE: A circuit uses an ordered list of nodes, so a circuit with nodes 1-2-3 is considered distinct from a circuit with nodes 2-3-1.
Excel in math and science
Master concepts by solving fun, challenging problems.
It's hard to learn from lectures and videos
Learn more effectively through short, conceptual quizzes.
Our wiki is made for math and science
Master advanced concepts through explanations,
examples, and problems from the community.
Used and loved by 4 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
by Brilliant Staff