k-Cographs are Kruskalian

First Page		Document Content
Date: 2011-06-16 14:46:21 Distance-hereditary graph Neighbourhood Clique Minor Induced path Graph coloring Graph Tree Path decomposition Graph theory Graph operations Cograph		k-Cographs are Kruskalian Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 186,09 KB Share Document on Facebook

	Finding an induced path of given parity in planar graphs in polynomial time Marcin Kami´nski ∗ Naomi Nishimura† DocID: 1s12G - View Document
	Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada DocID: 1rsEH - View Document
	Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar DocID: 1g2wf - View Document
	Randomized Algorithms 2015A Lecture 5 – Edge Sparsification for Cuts∗ Robert Krauthgamer 1 DocID: 1aFtk - View Document
	OntoNav: A Semantic Indoor Navigation System DocID: 1aA1B - View Document