43 Documenta Math. ¨ nigsberg, Euler, Mei-Ko Kwan, Ko

First Page		Document Content
Date: 2012-07-25 10:24:40 Graph theory NP-complete problems Eulerian path Route inspection problem Cycle Degree Leonhard Euler Matching Seven Bridges of Knigsberg 2-factor theorem		43 Documenta Math. ¨ nigsberg, Euler, Mei-Ko Kwan, Ko Add to Reading List Source URL: documenta.sagemath.org Download Document from Source Website File Size: 462,73 KB Share Document on Facebook

	43 Documenta Math. ¨ nigsberg, Euler, Mei-Ko Kwan, Ko DocID: 1pCdS - View Document
	43 Documenta Math. ¨ nigsberg, Euler, Mei-Ko Kwan, Ko DocID: 1pmcV - View Document
	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod DocID: 18y9b - View Document
	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: DocID: 18rhz - View Document
	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart† DocID: 180V2 - View Document