In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges l...
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges l...
Introduction: Vertex cover and independent set
56mMatchings: Konigs theorem and Halls theorem
58mMore on Halls theorem and some applications
57mTuttes theorem on existence of a perfect matching
58mMore on Tuttes theorem
58mMore on Matchings
57mDominating set, path cover
58mGallai : Millgram theorem, Dilworths theorem
57mConnectivity: 2-connected and 3- connected graphs
58mMengers theorem
56mMore on connectivity: k- linkedness
55mVertex coloring: Brooks theorem
57mMore on vertex coloring
55mEdge coloring: Vizing's theorem
56mProof of Vizings theorem, Introduction to planarity
56m5- coloring planar graphs, Kuratowskys theorem
57mProof of Kuratowskys theorem, List coloring
56mList chromatic index
57mAdjacency polynomial of a graph and combinatorial Nullstellensatz
56mChromatic polynomial, k - critical graphs
57mGallai-Roy theorem, Acyclic coloring, Hadwigers conjecture
54mPerfect graphs: Examples
57mInterval graphs, chordal graphs
57mProof of weak perfect graph theorem (WPGT)
56mSecond proof of WPGT, Some non-perfect graph classes
57mMore special classes of graphs
57mBoxicity,Sphericity, Hamiltonian circuits
57mMore on Hamiltonicity: Chvatals theorem
57mChvatals theorem, toughness, Hamiltonicity and 4-color conjecture
59mNetwork flows: Max flow mincut theorem
57mMore on network flows: Circulations
58mCirculations and tensions
58mMore on circulations and tensions, flow number and Tuttes flow conjectures
56mRandom graphs and probabilistic method: Preliminaries
57mProbabilistic method: Markovs inequality, Ramsey number
57mProbabilistic method: Graphs of high girth and high chromatic number
58mProbabilistic method: Second moment method, Lovasz local lemma
58mGraph minors and Hadwigers conjecture
58mMore on graph minors, tree decompositions
58m