User:Gomarios/Books/GraphTheory
| The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | |||||||||
Graph Theory
[edit]- 1-planar graph
- 26-fullerene graph
- Acyclic coloring
- Adjacency matrix
- Apex graph
- Arboricity
- Biconnected component
- Biggs–Smith graph
- Bipartite graph
- Biregular graph
- Block graph
- Book (graph theory)
- Book embedding
- Bridge (graph theory)
- Bull graph
- Butterfly graph
- Cactus graph
- Cage (graph theory)
- Cameron graph
- Canonical form
- Caterpillar tree
- Cayley graph
- Chain complex
- Characteristic polynomial
- Chord (geometry)
- Chordal bipartite graph
- Chordal completion
- Chordal graph
- Chromatic polynomial
- Chvátal graph
- Circle graph
- Circumference
- Class (set theory)
- Clebsch graph
- Cograph
- Comparability graph
- Complement graph
- Complete bipartite graph
- Complete coloring
- Complete graph
- Configuration (geometry)
- Connectivity (graph theory)
- Coxeter graph
- Crossing number (graph theory)
- Cube-connected cycles
- Cubic graph
- Cut (graph theory)
- Cycle (graph theory)
- Cycle double cover
- Cycle graph
- Cycle space
- Desargues configuration
- Desargues graph
- Distance (graph theory)
- Distance-regular graph
- Distance-transitive graph
- Dodecahedron
- Dominating set
- Dürer graph
- Edge coloring
- Equivalence class
- Folded cube graph
- Folkman graph
- Forbidden graph characterization
- Foster graph
- Fractional coloring
- Generalized Petersen graph
- Girth (graph theory)
- Glossary of graph theory terms
- Goldberg–Seymour conjecture
- Graph (discrete mathematics)
- Graph center
- Graph coloring
- Graph factorization
- Graph power
- Graph rewriting
- Gray graph
- Halved cube graph
- Hamiltonian path
- Hamiltonian path problem
- Hanoi graph
- Heawood graph
- Hypercube graph
- Hypergraph
- Hypohamiltonian graph
- Incidence geometry
- Incidence structure
- Induced subgraph
- Integral graph
- Intersection graph
- K-edge-connected graph
- Kneser graph
- Knot (mathematics)
- Levi graph
- Linkless embedding
- List coloring
- Ljubljana graph
- Matching (graph theory)
- McLaughlin graph
- Medial graph
- Meredith graph
- Moore graph
- Moser spindle
- Multigraph
- Multipartite graph
- Möbius–Kantor graph
- Nauru graph
- Nowhere-zero flow
- Null graph
- Odd graph
- Ordered pair
- Pappus graph
- Partial cube
- Path (graph theory)
- Path graph
- Peripheral cycle
- Perkel graph
- Petersen family
- Petersen graph
- Poussin graph
- Rado graph
- Regular graph
- Regular polygon
- Scale-free network
- Schläfli symbol
- Shrikhande graph
- Sierpiński triangle
- Snark (graph theory)
- Sousselier graph
- Spectral graph theory
- SPQR tree
- Star polygon
- Strongly chordal graph
- Sylvester graph
- Symmetric graph
- Thue number
- Topological graph theory
- Total coloring
- Travelling salesman problem
- Tree (graph theory)
- Truncated hexagonal trapezohedron
- Tutte 12-cage
- Tutte–Coxeter graph
- Unit distance graph
- Universal vertex
- Vertex (graph theory)
- Vertex cover
- Vizing's theorem
- Wells graph
- Wheel graph
- Y-Δ transform