Connectivity and spanning bipartite subgraphs

dc.contributor.advisor	Martínez Fernández, Luis	es
dc.contributor.advisor	Sangroniz Gómez, Josu	es
dc.contributor.author	Barcena Petisco, Jon Asier	es
dc.contributor.other	F. CIENCIA Y TECNOLOGIA	es
dc.contributor.other	ZIENTZIA ETA TEKNOLOGIA F.	eu
dc.date.accessioned	2017-01-09T18:44:53Z
dc.date.available	2017-01-09T18:44:53Z
dc.date.issued	2017-01-09
dc.identifier.uri	http://hdl.handle.net/10810/20122
dc.description.abstract	In this work we study an especific branch of Graph Theory: connectivity. The idea is that someone who is not familiar with Graph Theory learns enough of it in order to understand cutting edge results. Nonetheless, it is assumed that the reader is comfortable with inductive and Reductio ad Absurdum reasonings. We also present a small original result.	es
dc.language.iso	eng	es
dc.rights	info:eu-repo/semantics/openAccess	es
dc.subject	graphs	es
dc.subject	connectivity	es
dc.title	Connectivity and spanning bipartite subgraphs	es
dc.type	info:eu-repo/semantics/bachelorThesis	es
dc.date.updated	2016-06-23T06:24:40Z	es
dc.language.rfc3066	es	es
dc.rights.holder	Este trabajo está bajo Licencia Creative Commons Reconocimiento – NoComercial – SinObraDerivada (by-nc-nd)	es
dc.contributor.degree	Grado en Matemáticas	es
dc.contributor.degree	Matematikako Gradua	es
dc.identifier.gaurregister	70655-696770-09	es
dc.identifier.gaurassign	35249-696770	es