Annual status workshop[removed]TU Berlin, 13-17h, MA 212 and[removed]TU Berlin, 13-17h, MA[removed]:00-13:30 13:30-14:00 14:00-14:30

First Page		Document Content
Complexity classes Matroid theory NP-complete problems Dimension Matroid Cubic graph Induced path NP-hard Time complexity Theoretical computer science Graph theory Mathematics		Annual status workshop[removed]TU Berlin, 13-17h, MA 212 and[removed]TU Berlin, 13-17h, MA[removed]:00-13:30 13:30-14:00 14:00-14:30 Add to Reading List Source URL: www3.math.tu-berlin.de Download Document from Source Website File Size: 29,24 KB Share Document on Facebook

	DOUGLAS BAUER Professor Mathematical Sciences Department Stevens Institute of Technology EDUCATION Ph.D., Stevens Institute of Technology, 1978 DocID: 1qndD - View Document
	Crystals That Nature Might Miss Creating Toshikazu Sunada N DocID: 1pJ36 - View Document
	Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali DocID: 1pIgc - View Document
	MAX CUT in cubic graphs Eran Halperin ∗ Dror Livnat DocID: 1onhg - View Document
	EXPONENTIALLY MANY PERFECT MATCHINGS IN CUBIC GRAPHS L. ESPERET, F. KARDOŠ, A. D. KING, D. KRÁL’, AND S. NORINE Abstract. We show that every cubic bridgeless graph G has at least 2\|V (G)\|/3656 perfect matchings. This DocID: 1lp9s - View Document