Graph Theory

Related Fields

Parent Topic:

Mathematics, Combinatorics

Child Topic:

Max-flow min-cut theorem, Quad-edge, Power graph analysis, Percolation theory, Hexahedron, Biconnected graph, Forbidden graph characterization, Tetrahedron, Graph database, Random regular graph, König's lemma, Edmonds' algorithm, Perfect graph, Pathwidth, Menger's theorem, LCF notation, Crown graph, Archimedean solid, Interval graph, Color-coding, Lowest common ancestor, Disjoint union, Degree, Theta graph, Graph homomorphism, Network controllability, Gray graph, Tutte matrix, Parameterized complexity, Lexicographic breadth-first search, Six degrees of separation, Quartic graph, Multigraph, Voltage graph, Interval order, Connected dominating set, Cycle rank, Hereditarily finite set, De Bruijn sequence, Comparability, Apollonian network, Hamming graph, Ramsey's theorem, Intersection graph, Kuratowski's theorem, Nodal analysis, Open-circuit time constant method, Weighted network, k-edge-connected graph, Medial graph, Map coloring, Tellegen's theorem, Star network, Matroid, Cayley graph, Breadth-first search, Dijkstra's algorithm, Database theory, Feedback vertex set, Erdős–Rényi model, Tree-depth, Pointer swizzling, Analytic combinatorics, Laplacian matrix, Motor soft starter, Ljubljana graph, Kirchhoff's circuit laws, Majority function, Euler tour technique, Algebraic connectivity, Null model, K shortest path routing, Apex graph, Upper and lower bounds, Vertex-transitive graph, Flow network, Clique, Block graph, Probabilistic method, Minimum degree spanning tree, Graph product, Noncrossing partition, Dual graph, Comparability graph, Symmetric graph, Clustering coefficient, Toroidal graph, Mixed graph, Path graph, Linear extension, Small-world network, Clique graph, Simon model, Barabási–Albert model, Cheeger constant, Fibonacci polynomials, Average path length, Treewidth, Isogonal figure, Loop-erased random walk, Covering graph, Indifference graph, Link-state routing protocol, Chromatic polynomial, Register allocation, Hasse diagram, Fractional coloring, Op amp integrator, Graph labeling, Critical graph, Aanderaa–Karp–Rosenberg conjecture, Bidimensionality, Odd graph, Paley graph, Dominating set, Moral graph, Symmetric closure, Floyd–Warshall algorithm, Graph rewriting, Circulant graph, Tait conjectures, Cubic graph, Graph drawing, Impedance parameters, Turán graph, Ring network, Network dynamics, Feedback arc set, Logical matrix, Golomb ruler, Heawood graph, Kruskal's tree theorem, Dense graph, Friend of a friend, Induced path, Van der Waerden's theorem, Regular icosahedron, Electronic Colloquium on Computational Complexity, Adjacency matrix, Partition regularity, Line graph, Null graph, Strength of a graph, Graph partition, Pappus graph, Lovász number, Aperiodic graph, Random walker algorithm, Topological graph theory, Cube-connected cycles, Skew-symmetric graph, Log-space reduction, Complexity of constraint satisfaction, Moore graph, Petersen family, Pancyclic graph, Triangular bipyramid, BEST theorem, Tutte polynomial, Mesh analysis, Polyhedral graph, Ordered vector space, Laman graph, Canadian traveller problem, Scale-free network, Algebraic graph theory, Incidence matrix, Incidence algebra, Decomposition method, Hosoya index, Charge amplifier, Trivially perfect graph, Permanent, Traffic flow, Branch-decomposition, Ménage problem, Ramsey theory, Reachability, Maximum flow problem, Edge contraction, Linkless embedding, Butterfly graph, Control flow graph, Spectral graph theory, Graph traversal, Outerplanar graph, Method of conditional probabilities, Cube, Desargues graph, Loop, Transitive relation, Dynamic network analysis, Complete coloring, Asymmetric graph, Vertex cover, Seidel adjacency matrix, Biregular graph, Wheel graph, Complement graph, Prüfer sequence, Star product, Prim's algorithm, Johnson's algorithm, Order theory, Assortative mixing, Multipath routing, Abstract semantic graph, Graph operations, Hamiltonian path problem, Graph, Goldberg polyhedron, Randomized rounding, Evolving networks, Strong perfect graph theorem, Connectivity, Hopcroft–Karp algorithm, Bridge, Wagner graph, Graph enumeration, Technology strategy, Longest path problem, Crossing number, Eulerian path, Distance, Cograph, Tree decomposition, Dinic's algorithm, Unit disk graph, Integral nonlinearity, Asymmetric relation, Antisymmetric relation, Modular decomposition, Percolation threshold, De Bruijn graph, Kruskal's algorithm, Adjacency list, Graph power, Arborescence, Network theory, Greedy coloring, Dilworth's theorem, Domino tiling, Clebsch graph, Cage, Geometric graph theory, Partially ordered set, Reflexive relation, List coloring, Matching, Median graph, Closure problem, Hierarchical network model, Arboricity, Minimum-cost flow problem, Conductance, Partition refinement, Spherical polyhedron, Resistance distance, Minimum spanning tree, Random geometric graph, Covering relation, Edge coloring, String graph, Giant component, Neighbourhood, Quantum graph, Cycle space, Depth-limited search, Random graph, Geometric networks, Spanning tree, Planarity testing, Path, Network science, Euclidean minimum spanning tree, Clique-width, Erdős–Szekeres theorem, Kneser graph, Brooks' theorem, Distance-regular graph, Permutation graph, Graph energy, Transpose graph, Kernelization, Turán's theorem, Extremal graph theory, Exponential random graph models, Graph center, Internet topology, Katz centrality, Edge-transitive graph, Four color theorem, Dependency graph, Foster graph, Directed acyclic graph, Widest path problem, Hollow matrix, Betweenness centrality, Tarjan's strongly connected components algorithm, Independent set, Stellation, Latin square, Frequency partition of a graph, Network topology, Cut, Graph automorphism, Circuit rank, Edmonds–Karp algorithm, Hall's marriage theorem, Property testing, Family of sets, Clique problem, Trapezoid graph, Shortest-path tree, Rado graph, Claw-free graph, Complex contagion, Transitive closure, Interpersonal ties, Barnette's conjecture, Symmetric relation, Intransitivity, Temporally ordered routing algorithm, Rotation system, Unordered pair, Graph isomorphism, Depth-first search, Wireless ad hoc network, Combinatorial proof, Structural rigidity, Bijective proof, SPQR tree, Mobile ad hoc network, Triadic closure, Level structure, Padovan sequence, Shortest path problem, Combinatorial class, Friendship graph, Partition of a set, Disjoint-set, Dual polyhedron, Complete bipartite graph, Y-Δ transform, Representation, Two-graph, Blossom algorithm, Total relation, Vertex separator, Weighted matroid, Integral graph, Universal graph, Route inspection problem, K-tree, Metric dimension, Graph property, Kempe chain, Graph factorization, Antichain, Star, Robertson–Seymour theorem, Constraint graph, Bipartite graph, Product order, Seven Bridges of Königsberg, Modified nodal analysis, Halin graph, Biconnected component, Power gain, Multiple edges, Cycle graph, Graph, Graph bandwidth, Topology, Iterative deepening depth-first search, Spatial network, Transitive reduction, Longest increasing subsequence, Split graph, Cycle basis, Vertex, Distance matrix, Boxicity, Multitree, Percolation, Book embedding, Preorder, Complex network, Cycle detection, Reconstruction conjecture, Chordal graph, Degree matrix, Circle graph, Topological sorting, Homeomorphism, Generalized Petersen graph, Centrality, Binary relation, Hypercube graph, Hamiltonian path, Dodecahedron, Domatic number, Tree traversal, Graph minor, Total order, Lattice graph, 1-planar graph, Strong orientation, Bound graph, Subgraph isomorphism problem, Circle packing theorem, Induced subgraph isomorphism problem, Topological graph, Maximal independent set, Distributed minimum spanning tree, Knight's tour, Hexagonal lattice, Graphic matroid, Shrikhande graph, Five color theorem, Degree distribution, Order dimension, Pseudoforest, Bidirected graph, Strongly regular graph, Tournament, Expander graph, Self-avoiding walk, Structural cohesion, Edge cover, Matroid partitioning, Coxeter graph, Petersen graph, co-NP-complete, Friendship paradox, Graph embedding, Assortativity, Complete graph, Octahedron, Dimension, Strongly connected component, Mixing patterns, Graph coloring, Planar graph, Fibonacci cube, Regular graph, Graph isomorphism problem, Clique percolation method, Graph canonization, Rook's graph, Connected component, Maximal element, Tree, A* search algorithm, Triangle-free graph, NP-complete, Directed graph, Edge space

Top Authors

Paper Recommendation
2001 Introduction To Algorithms

1988 An introduction To Computing With Neural Nets

1976 Graph Theory With Applications

1976 A Complexity Measure

1982 Combinatorial Optimization: Algorithms and Complexity

1986 Theory of Linear and integer Programming

1995 An information-maximization Approach To Blind Separation and Blind Deconvolution

1980 Algorithmic Graph Theory and Perfect Graphs

1983 Data Structures and Algorithms

1985 Graphs and Hypergraphs

1983 Data Structures and Network Algorithms

1984 Conceptual Structures: information Processing in Mind and Machine

2001 Introduction To Graph Theory

1969 Graph Theory Addison-wesley

2002 Community Structure in Social and Biological Networks

1975 Multidimensional Binary Search Trees Used For Associative Searching

1997 Normalized Cuts and Image Segmentation

1994 Molecular Computation of Solutions To Combinatorial Problems

1980 Fuzzy Sets and Systems

1997 Signal Stability-based Adaptive Routing (SSA) For Ad Hoc Mobile Networks