ScienceWISE

Graph theory

Definitions and resources

ScienceWISE definitions	External resources
	Graph theory by Wikipedia

Subcategories and concepts

Subcategories

Concepts

Cayley tree Cartesian product of graphs Conditional coloring of graph Conditional chromatic number Gear graph Join of graphs Undirected graph Bipartite graph Chordal graph Decomposable graph Trapezoid graph Aanderaa-Karp-Rosenberg conjecture Aczel's anti-foundation axiom Alpha centrality Assortative mixing Assortativity BEST theorem Bicircular matroid Chemical graph theory Circuit rank Clique-width Complex network zeta function Continuous graph Covering graph Cubic graph Cycle decomposition Cycle double cover Dissociation number Domatic number Edge cycle cover Edge-graceful labeling Erdős-Burr conjecture Erdős-Gyárfás conjecture Erdős-Rényi model Erdős-Gallai theorem Erdős-Pósa theorem Evolutionary graph theory Expander mixing lemma Forbidden graph characterization Frequency partition of a graph Friendly-index set Friendship paradox Graceful labeling Graph Graph algebra Graph bandwidth Graph canonization Graph coloring Graph dynamical system Graph equation Graph factorization Graph homomorphism Graph isomorphism Handshaking lemma Hereditary property Icosian Calculus Icosian game Implicit graph Knight's tour Wheel graph König's lemma LCF notation Lovász conjecture Lovász number Mathematical chemistry Modular decomposition Multi-level technique Multi-trials technique Network theory Panconnectivity Pancyclic graph Path cover Peripheral cycle Power graph analysis Ramsey's theorem Random geometric graph Random graph Reconstruction conjecture Robbins theorem Sequential dynamical system Shannon multigraph Shortcut model Shortest path tree Single-entry single-exit Skip graph Steiner points Symmetric hypergraph theorem Szemerédi regularity lemma Szymanski's conjecture Theorem on friends and strangers Trace diagram Transitive reduction Trémaux tree Turán number Tutte matrix Tutte theorem Unique sink orientation Vickrey auction Canadian traveller problem Clique cover Clique problem Connected dominating set Degree diameter problem Dominating set Edge cover Edge dominating set Feedback arc set Feedback vertex set Graph isomorphism problem Graph partition Graph sandwich problem Hamiltonian path Hamiltonian path problem Induced subgraph isomorphism problem Longest path problem Longest uncrossed knight's path Maximum common subgraph isomorphism problem Maximum cut Metric k-center Minimum k-cut Pebble motion problems Planarity testing Route inspection problem Set TSP problem Shortest path problem Snake-in-the-box Spanning tree Steiner tree problem Subgraph isomorphism problem Travelling salesman problem Unrooted tree path lengths Vertex cover Vertex cycle cover Widest path problem A* search algorithm AF-heap Algorithmic version for Szemerédi regularity partition Alpha-beta pruning Aperiodic graph Barabási-Albert model Belief propagation Bellman-Ford algorithm Bidirectional search Borůvka's algorithm Bottleneck traveling salesman problem Breadth-first search Bron-Kerbosch algorithm Chaitin's algorithm Cheriyan-Mehlhorn/Gabow algorithm Christofides algorithm Clique percolation method Closure problem Contraction hierarchies Cuthill-McKee algorithm Depth-first search Depth-limited search Dijkstra's algorithm Dijkstra-Scholten algorithm Dinic's algorithm Dulmage-Mendelsohn decomposition Edmonds algorithm Edmonds's matching algorithm Edmonds-Karp algorithm Euler tour technique FKT algorithm Flooding algorithm Flow network Floyd-Warshall algorithm Force-based algorithms Ford-Fulkerson algorithm Fringe search Girvan-Newman algorithm Gomory-Hu tree Graph embedding Graph reduction Graph rewriting Graph traversal Hierarchical clustering of networks Hopcroft-Karp algorithm IDA* Iterative deepening depth-first search Johnson's algorithm Junction tree algorithm Karger's algorithm Kosaraju's algorithm Kruskal's algorithm Lexicographic breadth-first search Nearest neighbour algorithm Nonblocking minimal spanning switch Prim's algorithm Proof-number search Push-relabel maximum flow algorithm Reverse-delete algorithm Sethi-Ullman algorithm SMA* Spectral layout Strongly connected component Suurballe's algorithm Tarjan's off-line least common ancestors algorithm Tarjan's strongly connected components algorithm Topological sorting Tree traversal Uniform-cost search Arborescence Cause-effect graph De Bruijn graph Dependency graph Directed acyclic graph Directed graph Directed pseudoforest Implication graph Kautz graph New digraph reconstruction conjecture Propositional directed acyclic graph Skew-symmetric graph St-connectivity Transpose graph Wait-for graph Why-Because analysis Graph product Hedetniemi's conjecture Lexicographic product of graphs Min-plus matrix multiplication Modular product of graphs Rooted product of graphs Strong product of graphs Tensor product of graphs Vizing's conjecture Zig-zag product Optimum branching

General information

Categorization	Also known as
Mathematics (under construction)

© 2009-2012 ScienceWISE project | About | FAQ | Contact us | Report Bug | Acknowledgement