To access the full text documents, please follow this link: http://hdl.handle.net/2117/134647
dc.contributor | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics |
dc.contributor.author | Chapuy, G. |
dc.contributor.author | Perarnau Llobet, Guillem |
dc.date | 2018-09-17 |
dc.identifier.citation | Chapuy, G.; Perarnau-Llobet, G. Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture. "Journal of combinatorial theory. Series B", 17 Setembre 2018, vol. 136, p. 44-71. |
dc.identifier.citation | 0095-8956 |
dc.identifier.citation | 10.1016/j.jctb.2018.09.004 |
dc.identifier.uri | http://hdl.handle.net/2117/134647 |
dc.language.iso | eng |
dc.relation | https://www.sciencedirect.com/science/article/pii/S0095895618300856 |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights | info:eu-repo/semantics/openAccess |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject | Graph theory |
dc.subject | Grafs, Teoria de |
dc.title | Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract |