K-edge-connected graph - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-10-07 11:22:31 Graph theory NP-complete problems Graph connectivity Graph operations Graph coloring Degeneracy Tree Neighbourhood Clique K-edge-connected graph Vertex cover Degree		Add to Reading List Source URL: fpt.akt.tu-berlin.de Download Document from Source Website File Size: 401,43 KB Share Document on Facebook

	Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that DocID: 1r5gC - View Document
	Drawing Power Law Graphs using a Local/Global Decomposition ∗ Reid Andersen Fan Chung DocID: 1pSVp - View Document
	Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou1,?,?? , Marcin Kami´nski2 , and Dimitrios M. Thilikos3? ? ? 1 2 DocID: 1p069 - View Document
	c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16. DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of DocID: 1oDUa - View Document
	Tri-edge connectivity augmentation in planar straight line graphs Mashhood Ishaque Marwan Al-Jubeh, Krist´of R´edei, Diane L. Souvaine, and Csaba D. T´oth. DocID: 1nU53 - View Document