Graph theory

1 article

Connectivity Graph planar Matching Eulerian path Hamiltonian path Flow network Spectral graph theory Graph random Directed graph Acyclic orientation Albertson index Authority distribution Bipartite graph Biregular graph Bivariegated graph Block graph Bridged graph Bridgeless graph Butterfly graph Cactus graph Cage Calculus on finite weighted graphs Cartesian product of graphs Caterpillar tree Centrality Centroid Chordal bipartite graph Chordal completion Chordal graph Circle graph Circuit rank Circumference Claw Claw free graph Clique Clique graph Clique number Cograph Common graph Complement graph Complete bipartite graph Complete graph Complete multipartite graph Complex network Consensus dynamics Convex subgraph Copying network models Corona product Critical graph Cube connected cycles Cube graph Cubic graph Cubicity Cycle Cycle decomposition Cycle graph De bruijn graph Deficiency Degeneracy Degree Degree diameter Degree sequence Dense graph Dense subgraph Diameter Diamond graph Digon Dipole graph Discharging method Distance Dot product representation of a graph Edgeless graph Eigenvector centrality Entanglement Erdosgyarfas conjecture Expander graph Fibration symmetry Folded cube graph Forcing graph Functional graph Geometric spanner Girth Graph Graph algebra Graph amalgamation Graph center Graph continuous function Graph discrete mathematics Graph dynamical system Graph edit distance Graph entropy Graph equation Graph exploration algorithm Graph flattenability Graph operations Graph partition Graph pebbling Graph power Graph property Graph reduction Graph theory 17361936 Graph triangulation Group centrality Half square Halved cube graph Handshaking lemma Hierarchical closeness Hypercube Hypercube graph Hypergraph regularity method Implicit graph Incidence Independence number Indifference graph Induced cycle Induced path Induced subgraph Intersection graph Intersection graphs of hypergraphs Intersection number Interval graph K tree Knights tour Lattice graph Leaf power Line graph Local world evolving network models Lollipop graph Maximal clique Maximally matchable edge Maximum clique Median graph Meyniel graph Mixed graph Modular graph Multigraph Neighbourhood Node Null graph Null model Nullity Odd graph Order zero graph Pairwise compatibility graph Partial cube Path Path analysis Pearls in graph theory Perfect graph Perfect graph theorem Perfectly orderable graph Peripheral cycle Petersen graph Petersens theorem Phase field models on graphs Power graph analysis Prime graph Proper interval graph Pseudoforest Rainbow matching Reconstruction conjecture Regular graph Rooted graph Scale free network Seven bridges of konigsberg Simple graph Simplicial vertex Small world network Snark Sparse graph Sphericity Split Split graph Squaregraph Star graph theory Stepwise irregular graph String graph Strong orientation Strong perfect graph theorem Strongly chordal graph Theta graph Thomsen graph Threshold graph Topological graph Total graph Tournament Traceable graph Transpose graph Tree spanner Triangle free graph Triangle graph Trophic coherence Ultragraph c algebra Undirected graph Utility graph Vertex k center problem Vertex space Visibility graph Well covered graph Wheel graph Windmill graph 1 factorization 1 vs 2 cycles problem 110 vertex iofinova ivanov graph 2 factor theorem A search algorithm Activity driven model Acyclic coloring Adjacency algebra Adjacent vertex distinguishing total coloring Albertson conjecture Algebraic connectivity Allegrograph Alon boppana bound Alpha beta pruning Alpha centrality Alspachs conjecture Amazon neptune Andr sfai graph Antiprism graph Aperiodic graph Apollonian network Arangodb Archimedean graph Aromaticity Arrangement graph Asteroidal triple free graph Attributed graph grammar Autologistic actor attribute models B coloring Babais problem Balaban 10 cage Balaban 11 cage Balinskis theorem Barab si albert model Barnette bos k lederberg graph Barnettes conjecture Belief propagation Bellman ford algorithm Berges theorem Best theorem Betti number Betweenness centrality Bianconi barab si model Bicircular matroid Biconnected component Biconnected graph Bidiakis cube Bidirectional search Biggs smith graph Bipartite realization problem Blanu a snarks Blazegraph Blossom algorithm Bor vkas algorithm Bottleneck traveling salesman problem Brandes algorithm Breadth first search Bridge Brinkmann graph Bristol bridges walk Bron kerbosch algorithm Brooks theorem Bully algorithm Burr erd's conjecture Cameron graph Canadian traveller problem Capacitated arc routing problem Cederbaums maximum flow theorem Centered coloring Cerecedas conjecture Certified dominating set Chaitins algorithm Chang graphs Chessboard complex Chi bounded Chinese postman problem Chip firing game Christofides algorithm Chromatic polynomial Chv tal graph Circle packing theorem Circulant graph Circular coloring Clebsch graph Clique cover Clique percolation method Clique problem Closure problem Cluster graph Clustering coefficient Cocoloring Col Color coding Colour refinement algorithm Combinatorial map Complete coloring Complex network zeta function Component Conference graph Conflict free coloring Connected dominating set Continuous time quantum walk Contraction hierarchies Conways 99 graph problem Copying mechanism Correlation clustering Counting lemma Courcelles theorem Cover time Covering space Coxeter graph Crossing number Crossing number inequality Crossing numbers of graphs Crown graph Cut Cycle basis Cycle double cover Cycle rank Cycle space Datastax De bruijn erd's theorem Defective coloring Degree diameter problem Degree distribution Dejter graph Deletion contraction formula Depth first search Desargues graph Dessin denfant Deterministic rendezvous problem Dgml Diamond cubic Digraph realization problem Dijkstra scholten algorithm Dijkstras algorithm Dinics algorithm Dinitz conjecture Discrete laplace operator Disparity filter algorithm of weighted network Distance hereditary graph Distance oracle Distance regular graph Distance transitive graph Distinguishing coloring Domatic number Dominating set Dot Double pushout graph rewriting Double star snark Dsatur Dual graph Dually chordal graph Dulmage mendelsohn decomposition Dyck graph Dynamic connectivity Dynamic link matching Earth moon problem Edge and vertex spaces Edge coloring Edge connectivity Edge cover Edge dominating set Edge transitive graph Edmonds algorithm Edmonds karp algorithm Edmonds matrix Efficient dominating set Elementary number theory group theory and ramanujan graphs Ellingham horton graph Equitable coloring Equitable partition Erd's faber lov sz conjecture Erd's gallai theorem Erd's gy rf's conjecture Erd's hajnal conjecture Erd's on graphs Erd's p sa theorem Erd's r nyi model Erd's stone theorem Ern conjecture Euler characteristic Euler tour technique Eulers gem Even circuit theorem Exact coloring Expander mixing lemma External memory graph traversal Extremal ensemble learning F rys theorem F26a graph Feedback arc set Feedback vertex set Five color theorem Five room puzzle Fkt algorithm Flag algebra Fleischners theorem Flockdb Flower snark Floyd warshall algorithm Folkman graph Forbidden graph characterization Force directed graph drawing Ford fulkerson algorithm Foster cage Foster graph Four color theorem Fractional coloring Fractional dominating set Frankl r dl graph Franklin graph Frequency partition Frequent subtree mining Friendship paradox Fringe search Frucht graph Fruchts theorem Fulkerson chen anstee theorem Gale ryser theorem Gallai edmonds decomposition Gallai hasse roy vitaver theorem Gammoid Geiringer laman theorem Generalized map Generalized petersen graph Genus Gewirtz graph Giant component Gilbert pollak conjecture Girvan newman algorithm Global dominating set Gnrs conjecture Goal node Goldberg seymour conjecture Gomory hu tree Good spanning tree Gosset graph Gr nbaum nash williams conjecture Gr tzschs theorem Graham pollak theorem Graph automorphism Graph bandwidth Graph canonization Graph coarsening algorithm Graph coloring game Graph cut optimization Graph cuts in computer vision and artificial intelligence Graph database Graph embedding Graph encoded map Graph energy Graph kernel Graph manifold Graph matching Graph modelling language Graph neural network Graph realization problem Graph removal lemma Graph rewriting Graph sandwich problem Graph structure theorem Graph theory 1736 1936 Graph toughness Graph traversal Graphblas Graphcrunch Graphic matroid Graphical game theory Graphml Graphon Grassmann graph Gray graph Great Greedy coloring Grgen Grinbergs theorem Growth rate Grundy number Gun Gxl Gy rf's sumner conjecture Gyo algorithm Hadwiger conjecture Hadwiger nelson problem Haj's construction Half transitive graph Halins grid theorem Hall janko graph Hall type theorems for hypergraphs Halls marriage theorem Hamiltonian coloring Hamiltonian cycle polynomial Hamiltonian path problem Hamming graph Hanani tutte theorem Harborth graph Harmonious coloring Harries graph Harries wong graph Havel hakimi algorithm Hcs clustering algorithm Heawood conjecture Heawood graph Heawood number Hedetniemis conjecture Hierarchical clustering of networks Hoffman graph Hoffman singleton graph Holt graph Homomorphic equivalence Hopcroft karp algorithm Horton graph Hypergraph removal lemma Icosian game Imbalance conjecture Incidence coloring Independence dominating set Independent dominating set Independent set Induced subgraph isomorphism problem Infinitegraph Initial attractiveness Instant insanity Integral graph Interval coloring Interval edge coloring Iterative compression Iterative deepening a Iterative deepening depth first search Janusgraph Johnson graph Johnsons algorithm Journal of graph algorithms and applications Jump point search Junction tree algorithm K shortest path routing Kahn kalai conjecture Kargers algorithm Katz centrality Kelmans seymour conjecture Kempe chain Khopca clustering algorithm Kirchhoffs theorem Klein graphs Kleitman wang algorithms Kneser graph Knowledge graph embedding Kosarajus algorithm Kotzigs conjecture Kotzigs theorem Kruskals algorithm Kuratowskis reduction theorem Kuratowskis theorem Lancichinetti fortunato radicchi benchmark Laves graph Lcf notation Left right planarity test Lexicographic breadth first search Line perfect graph Linear graph grammar Link prediction Linkless embedding Linkurious List coloring List edge coloring Livingstone graph Ljubljana graph Longest path problem Longest uncrossed knights path Loop erased random walk Loupekine snark Lov sz conjecture Lov sz woodall conjecture M bius kantor graph M bius ladder Mac lanes planarity criterion Markov chain Markov theorem Markstr m graph Matching polynomial Matsushimas formula Max flow min cut theorem Maxcliquedyn algorithm Maxddbs Maximal independent set Maximum agreement subtree problem Maximum common edge subgraph Maximum common induced subgraph Maximum cut Maximum entropy random graph model Maximum flow problem Maximum weight matching Maze generation algorithm Mcgee graph Mckay miller ir graph Mclaughlin graph Mengers theorem Meredith graph Meringer graph Metis Metric k center Min plus matrix multiplication Minimax Minimum bottleneck spanning tree Minimum diameter spanning tree Minimum k cut Minimum mean weight cycle Minimum rank of a graph Misra and gries edge coloring algorithm Mixed chinese postman problem Modularity Monochromatic triangle Moore graph Mulgara Multi trials technique Nash williams theorem Nauru graph Nearest neighbour algorithm Nebulagraph Neo4j Network flow problem Network simplex algorithm Network theory New digraph reconstruction conjecture Newick format Nitrosbase Node influence metric Nonblocker Nonblocking minimal spanning switch Nondeterministic constraint logic Oberwolfach problem Odd cycle transversal Optimal facility location Oracle spatial and graph Ores theorem Orientdb Oriented coloring P lya enumeration theorem P sas theorem Packing coloring Pagerank Paired dominating set Pappus graph Parallel all pairs shortest path algorithm Parallel breadth first search Parallel single source shortest path algorithm Parity graph Path based strong component algorithm Path coloring Pebble motion problems Percolation critical exponents Percolation threshold Perkel graph Permutation graph Petrie dual Pgf tikz Pic Pixel connectivity Planar separator theorem Planarity testing Planted clique Precoloring extension Prims algorithm Prism graph Proof number search Pseudorandom graph Ptolemaic graph Push relabel maximum flow algorithm Qlever Quadratic pseudo boolean optimization Quartic graph Queue number Radio coloring Rado graph Rainbow coloring Rainbow independent set Ramanujan graph Ramseys theorem Random cluster model Random geometric graph Random graph theory of gelation Random recursive tree Random regular graph Random tree Random walk closeness centrality Reachability Reads conjecture Recursive largest first algorithm Regular map Regular path query Resistance distance Reverse delete algorithm Ribbon graph Road coloring theorem Robbins theorem Robertson graph Robertson seymour theorem Robertson wegner graph Rocha thatte cycle detection algorithm Roman dominating set Rooks graph Rotation system Rysers conjecture Scheinermans conjecture Schl fli graph Second neighborhood problem Seidels algorithm Semantic brand score Semi symmetric graph Sequence covering map Sequential dynamical system Set tsp problem Sethi ullman algorithm Seven bridges of k nigsberg Shift graph Shortest path problem Shrikhande graph Shuffle exchange network Sidorenkos conjecture Sims conjecture Single pushout graph rewriting Skew partition Sma Snake in the box Soft configuration model Sones graphdb Spanning tree Sparksee Spectral clustering Spectral layout Spqr tree Spreading activation St connectivity Star coloring Steiner tree problem Stochastic block model Stoer wagner algorithm Strong coloring Strong connectivity augmentation Strongly connected component Strongly regular graph Structural cohesion Subcoloring Substructure search Sudoku graph Sum coloring Sumners conjecture Supersingular isogeny graph Superstrong approximation Suurballes algorithm Suzuki graph Sylvester graph Symmetric graph Symmetric hypergraph theorem Szekeres snark Szymanskis conjecture T coloring Table of simple cubic graphs Tait conjectures Tarjans off line lowest common ancestors algorithm Tarjans strongly connected components algorithm Terminusdb The mathematical coloring book The mathematics of chip firing Theta Thrackle Three utilities problem Thue number Tietzes graph Tigergraph Token reconfiguration Tolerance graph Tom Topological sorting Toroidal graph Total coloring Transit node routing Trapezoid graph Travelling salesman problem Tree depth Triameter Tricolorability Trivial graph format Trivially perfect graph Tur ns brick factory problem Tur ns theorem Tutte 12 cage Tutte coxeter graph Tutte graph Tutte path Tuttes theorem on hamiltonian cycles Tuttes theorem on perfect matchings Tuzas conjecture Typedb Unfriendly partition Uniconnected subgraph Uniquely colorable graph Vadalog Veblens theorem Vertex connectivity Vertex cover Vertex cover in hypergraphs Vertex cycle cover Vertex separator Vertex transitive graph Viatra Vizings conjecture Vizings theorem Wagner graph Wagners theorem Walk regular graph Watkins snark Watts strogatz model Weak coloring Weak component Wedderburn etherington number Weisfeiler leman graph isomorphism test Well colored graph Wells graph Whitneys planarity criterion Widest path problem Wiener connector Wilson operation Wong graph Xgmml Xuong tree Y and y transformation Yens algorithm Zarankiewicz problem Zero symmetric graph Zero weight cycle problem Cartographic projection Cartography mathematical problems in Cocktail party graph Crystallography mathematical Demographic analysis stochastic approach Game on a graph Graph circuit Graph colouring Graph connectivity of a Graph extremal Graph homeomorphism Graph imbedding Graph of a mapping Graph oriented Graphic equality Halin graph Hodograph Hodograph transform Holographic proof Kuratowski graph Local tomography Montmort matching problem Network graph Nomography Oceanography mathematical problems in Probability graph paper Pseudo local tomography Supergraph Telegraph equation Tomography

Combinatorics & Discrete Math LicenceExplication7 min

Tout tournoi contient une chaîne gagnante (théorème de Rédei)

Les résultats d'un toutes-rondes peuvent être un chaos total : des cycles partout, aucun champion. Une récurrence en un seul coup aligne pourtant tout le monde, chacun ayant battu le suivant.