Bookmarks
书签栏
- Graph theory - Wikipedia
Concepts
- Glossary of graph theory - Wikipedia
- Vertex (graph theory) - Wikipedia
- Distance (graph theory) - Wikipedia
- Adjacency matrix - Wikipedia
- incidence matrix
- Path (graph theory) - Wikipedia
- Directed graph - Wikipedia
- undirected graph
- Connectivity (graph theory) - Wikipedia
- Diameter
- Girth
- planar graph
- Automorphisms
- Chromatic number
- Chromatic index
- Book thickness
- Queue number
- Genus
- dense graph
- sparse graphs
- Shortest path problem - Wikipedia
- simple graphs
- Laman graph - Wikipedia
- unit distance graph
- complement graph
- graph coloring
- subgraph
- k-vertex-connected graph - Wikipedia
- Flow network - Wikipedia
- Levi graph - Wikipedia
- Distance-regular graph - Wikipedia
- Distance-transitive graph - Wikipedia
- Characteristic polynomial - Wikipedia
- degree matrix
- Laplacian matrix - Wikipedia
- Spectral graph theory - Wikipedia
- LCF notation
- Distance-regular graph - Wikipedia
Special Graph
- complete graphs
- bipartite graphs
- trees
- List of graphs by edges and vertices - Wikipedia
- Chvátal graph - Wikipedia
- 120-cell - Wikipedia
- Balaban 10-cage - Wikipedia
- Balaban 11-cage - Wikipedia
- Moser spindle - Wikipedia
- Frucht graph - Wikipedia
- Ljubljana graph - Wikipedia
- Heawood graph - Wikipedia
- Pappus graph - Wikipedia
- Biggs–Smith graph - Wikipedia
- Tutte 12-cage - Wikipedia
- Desargues graph - Wikipedia
- Petersen graph
- Generalized Petersen graph - Wikipedia
- Dürer graph - Wikipedia
- Bidiakis cube - Wikipedia
- Barnette–Bosák–Lederberg graph - Wikipedia
- Blanuša snarks - Wikipedia
- Brinkmann graph - Wikipedia
- Brouwer–Haemers graph
- Bull graph
- Butterfly graph
- Cameron graph
- Chang graphs
- Gray graph - Wikipedia
- Clebsch graph - Wikipedia
- Dyck graph - Wikipedia
- Möbius ladder - Wikipedia
Properties
- Regular
- Hamiltonian
- hypohamiltonian
- non-hamiltonian
- Triangle-free
- Eulerian
- Cubic
- Cage
- Planar
- Well-covered
- Toroidal graph - Wikipedia
- genus
Related
- rigidity theory
- Euclidean plane
- set theory
- Dilworth's theorem
- Eigenvalues and eigenvectors - Wikipedia
People
- György Hajós
- Leo Moser
- Hugo Hadwiger
- Edward Nelson
- Paul Erdős
- Nicolaas Govert de Bruijn
- Pappus of Alexandria
- Gérard Desargues
- Albrecht Dürer
- Danilo Blanuša
- Marion C. Gray
- Walther von Dyck
algorithms & theorems & problems
- Hadwiger–Nelson problem - Wikipedia
- De Bruijn–Erdős theorem (graph theory) - Wikipedia
- four-color theorem
- Brooks’ theorem
- Ramsey's theorem - Wikipedia