To access the full text documents, please follow this link: http://hdl.handle.net/2117/134251
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 | Kang, Ross |
dc.contributor.author | Perarnau Llobet, Guillem |
dc.date | 2014-10-15 |
dc.identifier.citation | Kang, R.; Perarnau-Llobet, G. Decomposition of bounded degree graphs into C4-free subgraphs. "European journal of combinatorics", 15 Octubre 2014, vol. 44, núm. Part A, p. 99-105. |
dc.identifier.citation | 0195-6698 |
dc.identifier.citation | 10.1016/j.ejc.2014.09.009 |
dc.identifier.uri | http://hdl.handle.net/2117/134251 |
dc.language.iso | eng |
dc.relation | https://www.sciencedirect.com/science/article/pii/S019566981400153X |
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::Combinatòria |
dc.subject | Combinatorial analysis |
dc.subject | edge-colouring |
dc.subject | graph decomposition |
dc.subject | graphs of bounded maximum degree |
dc.subject | degree Ramsey numbers |
dc.subject | bipartite Turán number |
dc.subject | Anàlisi combinatòria |
dc.title | Decomposition of bounded degree graphs into C4-free subgraphs |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract |