Search Britannica
Click here to search
Search Britannica
Click here to search
Subscribe
Login
https://premium.britannica.com/premium-membership/?utm_source=premium&utm_medium=nav-login-box&utm_campaign=evergreen
Subscribe
Now
Home
History & Society
Science & Tech
Biographies
Animals & Nature
Geography & Travel
Arts & Culture
ProCon
Money
Games & Quizzes
Videos
On This Day
One Good Fact
Dictionary
New Articles
History & Society
Lifestyles & Social Issues
Philosophy & Religion
Politics, Law & Government
World History
Science & Tech
Health & Medicine
Science
Technology
Biographies
Browse Biographies
Animals & Nature
Birds, Reptiles & Other Vertebrates
Bugs, Mollusks & Other Invertebrates
Environment
Fossils & Geologic Time
Mammals
Plants
Geography & Travel
Geography & Travel
Arts & Culture
Entertainment & Pop Culture
Literature
Sports & Recreation
Visual Arts
Companions
Demystified
Image Galleries
Lists
Podcasts
Spotlight
Summaries
The Forum
Top Questions
#WTFact
Britannica Kids
Ask the Chatbot
Games & Quizzes
History & Society
Science & Tech
Biographies
Animals & Nature
Geography & Travel
Arts & Culture
ProCon
Money
Videos
graph theory
Table of Contents
Introduction
References & Edit History
Related Topics
Images
For Students
graph theory summary
Quizzes
Numbers and Mathematics
Discover
9 of the World’s Deadliest Snakes
9 Worst Generals in History
Why Does Cilantro Taste Like Soap to Some People?
6 Interesting Facts about Srinivasa Ramanujan
The 10 Greatest Basketball Players of All Time
What's the Difference Between a Solstice and an Equinox?
10 Best Hockey Players of All Time
Contents
Home
Science
Mathematics
graph theory: Media
Share
Share
Share to social media
Facebook
X
URL
https://mainten.top/topic/graph-theory/images-videos
Images
bridges of Königsberg
In the 18th century the Swiss mathematician Leonhard Euler was intrigued by the question...
Encyclopædia Britannica, Inc.
basic types of graphs
Basic types of graphs.
Encyclopædia Britannica, Inc.
Eulerian circuit
A graph is a collection of vertices, or nodes, and edges between some or all of the...
Encyclopædia Britannica, Inc.
Hamiltonian circuit
A directed graph in which the path begins and ends on the same vertex (a closed loop)...
Encyclopædia Britannica, Inc.
K
5
K
5 is not a planar graph, because there does not exist any way...
Encyclopædia Britannica, Inc.
planar graph and nonplanar graph compared
With fewer than five vertices in a two-dimensional plane, a collection of paths between...
Encyclopædia Britannica, Inc.
K
3,2
A bipartite map, such as
K
3,2, consists of two sets of points...
Encyclopædia Britannica, Inc.
Dudeney puzzle
The English recreational problemist Henry Dudeney claimed to have a solution to a...
Encyclopædia Britannica, Inc.
VIEW MORE
in these related Britannica articles:
Media for: derivative
Media for: statistics
Media for: combinatorics
Media for: mathematics