Discrete Mathematics[removed]–12 www.elsevier.com locate disc - Graph minor - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2002-03-12 13:03:16 Minor Arboricity Planar graph Petersen graph Line graph Hamiltonian path Neighbourhood Clique Graph homomorphism Graph theory NP-complete problems Graph coloring		Discrete Mathematics[removed]–12 www.elsevier.com/locate/disc Add to Reading List Source URL: www.math.wvu.edu Download Document from Source Website File Size: 76,21 KB Share Document on Facebook

	Minimum Dominating Set Approximation in Graphs of Bounded Arboricity Christoph Lenzen and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich {lenzen,wattenhofer}@tik.ee.ethz.ch DocID: 1s1V7 - View Document
	Distributed Computing manuscript No. (will be inserted by the editor) Distributed Minimum Dominating Set Approximations in Restricted Families of Graphs Christoph Lenzen · Yvonne-Anne Pignolet · Roger Wattenhofer DocID: 1oXnq - View Document
	Circular Arboricity of Graphs J AN VAN DEN H EUVEL Centre for Discrete and Applicable Mathematics Department of Mathematics DocID: 1k1cG - View Document
	Circular Arboricity of Graphs J AN VAN DEN H EUVEL Centre for Discrete and Applicable Mathematics Department of Mathematics DocID: 1jQIl - View Document
	CCCG 2009, Vancouver, BC, August 17–19, 2009 On Graph Thickness, Geometric Thickness, and Separator Theorems Christian A. Duncan∗ Abstract DocID: 18POn - View Document