41. Restricted completion of sparse partial Latin squares. (20th September 2019) Authors: Andrén, Lina J.; Casselgren, Carl Johan; Markström, Klas Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 675 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
42. Separation Choosability and Dense Bipartite Induced Subgraphs. (26th September 2019) Authors: Esperet, Louis; Kang, Ross J.; Thomassé, Stéphan Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 720 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
43. Separation Choosability and Dense Bipartite Induced Subgraphs. (26th September 2019) Authors: Esperet, Louis; Kang, Ross J.; Thomassé, Stéphan Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 720 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
44. Weighted counting of solutions to sparse systems of equations. (15th September 2019) Authors: Barvinok, Alexander; Regts, Guus Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 696 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
45. Weighted counting of solutions to sparse systems of equations. (15th September 2019) Authors: Barvinok, Alexander; Regts, Guus Journal: Combinatorics, probability and computing Issue: Volume 28:Number 5(2019) Page Start: 696 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗