WeilSchaudt_DeltaChi_GaC.dvi

First Page		Document Content
Date: 2014-06-05 05:09:32 Graph theory Graph coloring NP-complete problems Graph operations Perfect graph theorem Line graph Perfect graph Clique Bipartite graph Triangle-free graph Strong perfect graph theorem Graph minor		WeilSchaudt_DeltaChi_GaC.dvi Add to Reading List Source URL: www.zaik.uni-koeln.de Download Document from Source Website File Size: 173,96 KB Share Document on Facebook

	Colouring Graphs When the Number of Colours is Almost the Maximum Degree∗ Michael Molloy Dept of Computer Science, University of Toronto 10 Kings College Rd. Toronto, ON, Canada, M5S 3G4 DocID: 1p53o - View Document
	WeilSchaudt_DeltaChi_GaC.dvi DocID: 1kCIb - View Document
	Strong Perfect Graph Theorem DocID: 1eZ1X - View Document
	Even-Hole-Free Graphs Part I: Decomposition Theorem Michele Conforti y Gerard Cornuejols Ajai Kapoor DocID: bRh8 - View Document
	Perfect Graphs, Partitionable Graphs and Cutsets Michele Conforti Gerard Cornuejols y Grigor Gasparyan z and Kristina Vuskovic x DocID: bQC3 - View Document