CMRTC College Data Share

Skip to content
Jump to main navigation and login

Nav view search

Navigation

Search

You are here: Home

Computer Science & IT

Graph Theory

Graph Theory

5- coloring planar graphs, Kuratowsky-s theorem-mod03lec17

Adjacency polynomial of a graph and combinatorial Nullstellensatz-mod03lec20

Boxicity,Sphericity, Hamiltonian circuits-mod04lec28

Chromatic polynomial, k - critical graphs-mod03lec21

Chvatal-s theorem, toughness, Hamiltonicity and 4-color conjecture-mod04lec30

Circulations and tensions-mod05lec33

Connectivity- 2-connected and 3- connected graphs-mod02lec09

Dominating set, path cover-mod01lec07

Edge coloring- Vizing-s theorem-mod03lec15

Gallai - Millgram theorem, Dilworth-s theorem-mod01lec08

Gallai-Roy theorem, Acyclic coloring, Hadwiger-s conjecture-mod03lec22

Graph minors and Hadwiger-s conjecture-mod07lec39

Interval graphs, chordal graphs-mod04lec24

Introduction- Vertex cover and independent set-mod01lec01

List chromatic index-mod03lec19

Matchings- Konig-s theorem and Hall-s theorem-mod01lec02

Menger-s theorem-mod02lec10

Minors, topological minors and more on k- linkedness-mod02lec12

More on Hall-s theorem and some applications-mod01lec03 (1)

More on Hamiltonicity- Chvatal-s theorem-mod04lec29

More on Matchings-mod01lec06

More on Tutte-s theorem-mod01lec05

More on circulations and tensions, flow number and Tutte-s flow conjectures-mod05lec34

More on connectivity- k- linkedness-mod02lec11

More on graph minors, tree decompositions-mod07lec40

More on network flows- Circulations-mod05lec32

More on vertex coloring-mod03lec14

More special classes of graphs-mod04lec27

Network flows- Max flow mincut theorem-mod05lec31

Perfect graphs- Examples-mod04lec23

Probabilistic method- Graphs of high girth and high chromatic number-mod06lec37

Probabilistic method- Markov-s inequality, Ramsey number-mod06lec36

Probabilistic method- Second moment method, Lovasz local lemma

Proof of Kuratowsky-s theorem, List coloring

Proof of Vizing-s theorem, Introduction to planarity

Proof of weak perfect graph theorem (WPGT)

Random graphs and probabilistic method- Preliminaries

Second proof of WPGT, Some non-perfect graph classes

Tutte-s theorem on existence of a perfect matching

Vertex coloring- Brooks theorem

Powered by Phoca Download