Perfect graph theorem
Results: 5
# | Item |
---|---|
1![]() | 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 3G4Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2011-01-05 22:31:04 |
2![]() | WeilSchaudt_DeltaChi_GaC.dviAdd to Reading ListSource URL: www.zaik.uni-koeln.deLanguage: English - Date: 2014-06-05 05:09:32 |
3![]() | Strong Perfect Graph TheoremAdd to Reading ListSource URL: www.theoremoftheday.org- Date: 2015-06-03 08:28:00 |
4![]() | Even-Hole-Free Graphs Part I: Decomposition Theorem Michele Conforti y Gerard Cornuejols Ajai KapoorAdd to Reading ListSource URL: integer.tepper.cmu.eduLanguage: English - Date: 2001-04-20 18:46:28 |
5![]() | Perfect Graphs, Partitionable Graphs and Cutsets Michele Conforti Gerard Cornuejols y Grigor Gasparyan z and Kristina Vuskovic xAdd to Reading ListSource URL: integer.tepper.cmu.eduLanguage: English - Date: 2000-09-19 18:20:11 |